| 218 | The Skyline Problem | Hard | sort |
| 493 | Reverse Pairs | Hard | sort |
| 506 | Relative Ranks | Easy | array |
| 522 | Longest Uncommon Subsequence II | Medium | string |
| 524 | Longest Word in Dictionary through Deleting | Medium | string |
| 857 | Minimum Cost to Hire K Workers | Hard | binary heap |
| 871 | Minimum Number of Refueling Stops | Hard | binary heap |
| 1329 | Sort the Matrix Diagonally | Medium | array |
| 1333 | Filter Restaurants by Vegan-Friendly, Price and Distance | Medium | array |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | greedy |
| 1370 | Increasing Decreasing String | Easy | string |
| 1626 | Best Team With No Conflicts | Medium | dynamic programming |
| 1727 | Largest Submatrix With Rearrangements | Medium | greedy |
| 1847 | Closest Room | Hard | sort |
| 1851 | Minimum Interval to Include Each Query | Hard | sort |
| 1859 | Sorting the Sentence | Easy | sort |
| 1887 | Reduction Operations to Make the Array Elements Equal | Medium | greedy |
| 1893 | Check if All the Integers in a Range Are Covered | Easy | greedy |
| 2070 | Most Beautiful Item for Each Query | Medium | sort |
| 2144 | Minimum Cost of Buying Candies With Discount | Easy | greedy |
| 2146 | K Highest Ranked Items Within a Price Range | Medium | breadth first search |
| 2171 | Removing Minimum Number of Magic Beans | Medium | math |
| 2191 | Sort the Jumbled Numbers | Medium | sort |
| 2225 | Find Players With Zero or One Losses | Medium | hash table |
| 2229 | Check if an Array Is Consecutive | Easy | hash table |
| 2233 | Maximum Product After K Increments | Medium | sort |
| 2234 | Maximum Total Beauty of the Gardens | Hard | two pointers |
| 2268 | Minimum Number of Keypresses | Medium | greedy |
| 2273 | Find Resultant Array After Removing Anagrams | Easy | string |
| 2274 | Maximum Consecutive Floors Without Special Floors | Medium | array |
| 2279 | Maximum Bags With Full Capacity of Rocks | Medium | greedy |
| 2280 | Minimum Lines to Represent a Line Chart | Medium | math |
| 2343 | Query Kth Smallest Trimmed Number | Medium | sort |
| 2345 | Finding the Number of Visible Mountains | Medium | math |
| 2354 | Number of Excellent Pairs | Hard | hash table |
| 2363 | Merge Similar Items | Easy | hash table |
| 2371 | Minimize Maximum Value in a Grid | Hard | greedy |
| 2389 | Longest Subsequence With Limited Sum | Easy | binary search |
| 2406 | Divide Intervals Into Minimum Number of Groups | Medium | array |
| 2410 | Maximum Matching of Players With Trainers | Medium | greedy |
| 2418 | Sort the People | Easy | sort |
| 2421 | Number of Good Paths | Hard | tree |
| 2449 | Minimum Number of Operations to Make Arrays Similar | Hard | greedy |
| 2459 | Sort Array by Moving Items to Empty Space | Hard | greedy |
| 2463 | Minimum Total Distance Traveled | Hard | dynamic programming |
| 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | Medium | breadth first search |
| 2497 | Maximum Star Sum of a Graph | Medium | sort |
| 2545 | Sort the Students by Their Kth Score | Medium | sort |
| 2548 | Maximum Price to Fill a Bag | Medium | greedy |
| 2563 | Count the Number of Fair Pairs | Medium | two pointers |
| 2567 | Minimum Score by Changing Two Elements | Medium | greedy |
| 2576 | Find the Maximum Number of Marked Indices | Medium | greedy |
| 2578 | Split With Minimum Sum | Easy | greedy |
| 2580 | Count Ways to Group Overlapping Ranges | Medium | array |
| 2587 | Rearrange Array to Maximize Prefix Score | Medium | greedy |
| 2589 | Minimum Time to Complete All Tasks | Hard | greedy |
| 2592 | Maximize Greatness of an Array | Medium | hash table |
| 2593 | Find Score of an Array After Marking All Elements | Medium | simulation |
| 2602 | Minimum Operations to Make All Array Elements Equal | Medium | binary search |
| 2616 | Minimize the Maximum Difference of Pairs | Medium | binary search |
| 2655 | Find Maximal Uncovered Ranges | Medium | array |
| 2659 | Make Array Empty | Hard | sort |
| 2679 | Sum in a Matrix | Medium | sort |
| 2681 | Power of Heroes | Hard | dynamic programming |
| 2713 | Maximum Strictly Increasing Cells in a Matrix | Hard | dynamic programming |
| 2722 | Join Two Arrays by ID | Medium | design |
| 2724 | Sort By | Easy | design |
| 2731 | Movement of Robots | Medium | math |
| 2736 | Maximum Sum Queries | Hard | stack |
| 2740 | Find the Value of the Partition | Medium | sort |
| 2747 | Count Zero Request Servers | Hard | two pointers |
| 2751 | Robot Collisions | Hard | simulation |
| 2766 | Relocate Marbles | Medium | hash table |
| 2779 | Maximum Beauty of an Array After Applying Operation | Medium | two pointers |
| 2809 | Minimum Time to Make Array Sum At Most x | Hard | dynamic programming |
| 2818 | Apply Operations to Maximize Score | Hard | binary heap |
| 2819 | Minimum Relative Loss After Buying Chocolates | Hard | greedy |
| 2824 | Count Pairs Whose Sum is Less than Target | Easy | two pointers |
| 2835 | Minimum Operations to Form Subsequence With Target Sum | Hard | greedy |
| 2838 | Maximum Coins Heroes Can Collect | Medium | two pointers |
| 2848 | Points That Intersect With Cars | Easy | array |
| 2860 | Happy Students | Medium | greedy |
| 2861 | Maximum Number of Alloys | Medium | math |
| 2863 | Maximum Length of Semi-Decreasing Subarrays | Medium | stack |
| 2895 | Minimum Processing Time | Medium | greedy |
| 2932 | Maximum Strong Pair XOR I | Easy | bit manipulation |
| 2933 | High-Access Employees | Medium | two pointers |
| 2935 | Maximum Strong Pair XOR II | Hard | bit manipulation |
| 2943 | Maximize Area of Square Hole in Grid | Medium | hash table |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | Medium | sort |
| 2952 | Minimum Number of Coins to be Added | Medium | greedy |
| 2966 | Divide Array Into Arrays With Max Difference | Medium | array |
| 2967 | Minimum Cost to Make Array Equalindromic | Medium | string |
| 2968 | Apply Operations to Maximize Frequency Score | Hard | two pointers |
| 2971 | Find Polygon With the Largest Perimeter | Medium | greedy |
| 2974 | Minimum Number Game | Easy | sort |
| 3009 | Maximum Number of Intersections on the Chart | Hard | array |
| 3011 | Find if Array Can Be Sorted | Medium | sort |
| 3025 | Find the Number of Ways to Place People I | Medium | sort |
| 3027 | Find the Number of Ways to Place People II | Hard | sort |
| 3035 | Maximum Palindromes After Operations | Medium | greedy |
| 3041 | Maximize Consecutive Elements in an Array After Modification | Hard | dynamic programming |
| 3074 | Apple Redistribution into Boxes | Easy | greedy |
| 3075 | Maximize Happiness of Selected Children | Medium | greedy |
| 3107 | Minimum Operations to Make Median of Array Equal to K | Medium | greedy |
| 3111 | Minimum Rectangles to Cover Points | Medium | greedy |
| 3119 | Maximum Number of Potholes That Can Be Fixed | Medium | greedy |
| 3132 | Find the Integer Added to Array II | Medium | sort |
| 3169 | Count Days Without Meetings | Medium | sort |
| 3180 | Maximum Total Reward Using Operations I | Medium | dynamic programming |
| 3181 | Maximum Total Reward Using Operations II | Hard | dynamic programming |
| 3186 | Maximum Total Damage With Spell Casting | Medium | dynamic programming |
| 3194 | Minimum Average of Smallest and Largest Elements | Easy | sort |
| 3264 | Final Array State After K Multiplication Operations I | Easy | two pointers |
| 3266 | Final Array State After K Multiplication Operations II | Hard | two pointers |
| 3273 | Minimum Amount of Damage Dealt to Bob | Hard | greedy |
| 3288 | Length of the Longest Increasing Path | Hard | binary search |
| 3301 | Maximize the Total Height of Unique Towers | Medium | greedy |
| 3309 | Maximum Possible Number by Binary Concatenation | Medium | sort |
| 3323 | Minimize Connected Groups by Inserting Interval | Medium | two pointers |
| 3346 | Maximum Frequency of an Element After Performing Operations I | Medium | two pointers |
| 3347 | Maximum Frequency of an Element After Performing Operations II | Hard | two pointers |
| 3362 | Zero Array Transformation III | Medium | greedy |
| 3380 | Maximum Area Rectangle With Point Constraints I | Medium | array |
| 3382 | Maximum Area Rectangle With Point Constraints II | Hard | array |
| 3394 | Check if Grid can be Cut into Sections | Medium | sort |
| 3397 | Maximum Number of Distinct Elements After Operations | Medium | greedy |
| 3413 | Maximum Coins From K Consecutive Bags | Medium | two pointers |
| 3424 | Minimum Cost to Make Arrays Identical | Medium | greedy |
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | Medium | math |
| 3431 | Minimum Unlocked Indices to Sort Nums | Medium | sort |
| 3446 | Sort Matrix by Diagonals | Medium | array |
| 3453 | Separate Squares I | Medium | geometry |
| 3454 | Separate Squares II | Hard | geometry |
| 3457 | Eat Pizzas! | Medium | greedy |
| 3458 | Select K Disjoint Special Substrings | Medium | greedy |
| 3464 | Maximize the Distance Between Points on a Square | Hard | binary search |
| 3476 | Maximize Profit from Task Assignment | Medium | greedy |
| 3478 | Choose K Elements With Maximum Sum | Medium | greedy |
| 3485 | Longest Common Prefix of K Strings After Removal | Hard | two pointers |
| 3491 | Phone Number Prefix | Easy | string |
| 3551 | Minimum Swaps to Sort by Digit Sum | Medium | sort |
| 3567 | Minimum Absolute Difference in Sliding Submatrix | Medium | two pointers |
| 3606 | Coupon Code Validator | Easy | string |
| 3607 | Power Grid Maintenance | Medium | depth first search |
| 3608 | Minimum Time for K Connected Components | Medium | simulation |
| 3613 | Minimize Maximum Component Cost | Medium | simulation |
| 3627 | Maximum Median Sum of Subsequences of Size 3 | Medium | greedy |
| 3631 | Sort Threats by Severity and Exploitability | Medium | sort |
| 3634 | Minimum Removals to Balance Array | Medium | two pointers |
| 3636 | Threshold Majority Queries | Hard | hash table |
| 3644 | Maximum K to Sort a Permutation | Medium | sort |
| 3645 | Maximum Total from Optimal Activation Order | Medium | greedy |
| 3646 | Next Special Palindrome Number | Hard | bit manipulation |
| 3649 | Number of Perfect Pairs | Medium | two pointers |
| 3656 | Determine if a Simple Graph Exists | Medium | graph |
| 3661 | Maximum Walls Destroyed by Robots | Hard | dynamic programming |
| 3667 | Sort Array By Absolute Value | Easy | sort |
| 3684 | Maximize Sum of At Most K Distinct Elements | Easy | binary heap |
| 3685 | Subsequence Sum After Capping Elements | Medium | dynamic programming |
| 3691 | Maximum Total Subarray Value II | Hard | binary heap |
| 3710 | Maximum Partition Factor | Hard | graph |
| 3727 | Maximum Alternating Sum of Squares | Medium | greedy |
| 3730 | Maximum Calories Burnt from Jumps | Medium | greedy |
| 3759 | Count Elements With at Least K Greater Values | Medium | sort |
| 3763 | Maximum Total Sum with Threshold Constraints | Medium | greedy |
| 3767 | Maximize Points After Choosing K Tasks | Medium | greedy |
| 3768 | Minimum Inversion Count in Subarrays of Fixed Length | Hard | two pointers |
| 3769 | Sort Integers by Binary Reflection | Easy | bit manipulation |
| 3774 | Absolute Difference Between Maximum and Minimum K Elements | Easy | array |
| 3780 | Maximum Sum of Three Numbers Divisible by Three | Medium | sort |
| 3799 | Word Squares II | Medium | sort |
| 3801 | Minimum Cost to Merge Sorted Lists | Hard | dynamic programming |
| 3806 | Maximum Bitwise AND After Increment Operations | Hard | greedy |
| 3814 | Maximum Capacity Within Budget | Medium | array |
| 3842 | Toggle Light Bulbs | Easy | hash table |
| 3851 | Maximum Requests Without Violating the Limit | Medium | two pointers |
| 3867 | Sum of GCD of Formed Pairs | Medium | simulation |
| 3890 | Integers With Multiple Sum of Two Cubes | Medium | hash table |
| 3893 | Maximum Team Size with Overlapping Intervals | Medium | binary search |
| 3905 | Multi Source Flood Fill | Medium | breadth first search |
| 3907 | Count Smaller Elements With Opposite Parity | Medium | array |
| 3913 | Sort Vowels by Frequency | Medium | hash table |
| 3920 | Maximize Fixed Points After Deletions | Hard | binary search |
| 3930 | Power Update After K-th Largest Insertion II | Hard | binary search tree |
| 3947 | Maximum Number of Items From Sale II | Medium | greedy |
| 3951 | Minimum Energy to Maintain Brightness | Medium | array |
| 3960 | Frequency Balance Subarray | Medium | hash table |
| 3974 | Maximum Total Sum of K Selected Elements | Medium | greedy |
| 3975 | Filter Occupied Intervals | Medium | sort |
| 3989 | Maximum Consistent Columns in a Grid | Hard | dynamic programming |