| 300 | Longest Increasing Subsequence | Medium | binary search |
| 307 | Range Sum Query - Mutable | Medium | tree |
| 315 | Count of Smaller Numbers After Self | Hard | tree |
| 969 | Pancake Sorting | Medium | sort |
| 1409 | Queries on a Permutation With Key | Medium | tree |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Hard | tree |
| 1649 | Create Sorted Array through Instructions | Hard | tree |
| 1756 | Design Most Recently Used Queue | Medium | design |
| 2179 | Count Good Triplets in an Array | Hard | tree |
| 2193 | Minimum Number of Moves to Make Palindrome | Hard | greedy |
| 2426 | Number of Pairs Satisfying Inequality | Hard | binary search tree |
| 2659 | Make Array Empty | Hard | sort |
| 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 |
| 3109 | Find the Index of Permutation | Medium | tree |
| 3161 | Block Placement Queries | Hard | binary search tree |
| 3187 | Peaks in Array | Hard | array |
| 3245 | Alternating Groups III | Hard | hash table |
| 3380 | Maximum Area Rectangle With Point Constraints I | Medium | array |
| 3382 | Maximum Area Rectangle With Point Constraints II | Hard | array |
| 3515 | Shortest Path in a Weighted Tree | Hard | tree |
| 3624 | Number of Integers With Popcount-Depth Equal to K II | Hard | math |
| 3671 | Sum of Beautiful Subsequences | Hard | math |
| 3768 | Minimum Inversion Count in Subarrays of Fixed Length | Hard | two pointers |
| 3777 | Minimum Deletions to Make Alternating Substring | Hard | string |
| 3841 | Palindromic Path Queries in a Tree | Hard | tree |
| 3907 | Count Smaller Elements With Opposite Parity | Medium | array |
| 3930 | Power Update After K-th Largest Insertion II | Hard | binary search tree |