| 1606 | Find Servers That Handled Most Number of Requests | Hard | binary heap |
| 1756 | Design Most Recently Used Queue | Medium | design |
| 1825 | Finding MK Average | Hard | design |
| 2034 | Stock Price Fluctuation | Medium | design |
| 2071 | Maximum Number of Tasks You Can Assign | Hard | greedy |
| 2102 | Sequentially Ordinal Rank Tracker | Hard | design |
| 2158 | Amount of New Area Painted Each Day | Hard | sort |
| 2276 | Count Integers in Intervals | Hard | design |
| 2349 | Design a Number Container System | Medium | design |
| 2353 | Design a Food Rating System | Medium | design |
| 2382 | Maximum Segment Sum After Removals | Hard | array |
| 2426 | Number of Pairs Satisfying Inequality | Hard | binary search tree |
| 2502 | Design Memory Allocator | Medium | design |
| 2519 | Count the Number of K-Big Indices | Hard | binary heap |
| 2590 | Design a Todo List | Medium | design |
| 2612 | Minimum Reverse Operations | Hard | breadth first search |
| 2617 | Minimum Number of Visited Cells in a Grid | Hard | breadth first search |
| 2653 | Sliding Subarray Beauty | Medium | two pointers |
| 2813 | Maximum Elegance of a K-Length Subsequence | Hard | greedy |
| 2817 | Minimum Absolute Difference Between Elements With Constraint | Medium | binary search tree |
| 2907 | Maximum Profitable Triplets With Increasing Prices I | Medium | binary search tree |
| 2913 | Subarrays Distinct Element Sum of Squares I | Easy | dynamic programming |
| 2916 | Subarrays Distinct Element Sum of Squares II | Easy | dynamic programming |
| 2921 | Maximum Profitable Triplets With Increasing Prices II | Hard | binary search tree |
| 2926 | Maximum Balanced Subsequence Sum | Hard | binary search tree |
| 2944 | Minimum Number of Coins for Fruits | Medium | dynamic programming |
| 2969 | Minimum Number of Coins for Fruits II | Hard | dynamic programming |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | Hard | two pointers |
| 3072 | Distribute Elements Into Two Arrays II | Hard | binary search tree |
| 3073 | Maximum Increasing Triplet Value | Medium | binary search tree |
| 3092 | Most Frequent IDs | Medium | binary heap |
| 3161 | Block Placement Queries | Hard | binary search tree |
| 3244 | Shortest Distance After Road Addition Queries II | Hard | graph |
| 3245 | Alternating Groups III | Hard | hash table |
| 3318 | Find X-Sum of All K-Long Subarrays I | Easy | two pointers |
| 3321 | Find X-Sum of All K-Long Subarrays II | Hard | two pointers |
| 3364 | Minimum Positive Sum Subarray | Easy | two pointers |
| 3369 | Design an Array Statistics Tracker | Hard | design |
| 3391 | Design a 3D Binary Matrix with Efficient Layer Tracking | Medium | design |
| 3408 | Design Task Manager | Medium | design |
| 3422 | Minimum Operations to Make Subarray Elements Equal | Medium | two pointers |
| 3507 | Minimum Pair Removal to Sort Array I | Easy | simulation |
| 3508 | Implement Router | Medium | design |
| 3510 | Minimum Pair Removal to Sort Array II | Hard | simulation |
| 3520 | Minimum Threshold for Inversion Pairs Count | Medium | binary search |
| 3567 | Minimum Absolute Difference in Sliding Submatrix | Medium | two pointers |
| 3569 | Maximize Count of Distinct Primes After Split | Medium | array |
| 3590 | Kth Smallest Path XOR Sum | Hard | depth first search |
| 3636 | Threshold Majority Queries | Hard | hash table |
| 3672 | Sum of Weighted Modes in Subarrays | Medium | two pointers |
| 3815 | Design Auction System | Medium | design |
| 3885 | Design Event Manager | Medium | design |
| 3930 | Power Update After K-th Largest Insertion II | Hard | binary search tree |