| 2306 | Naming a Company | Hard | 2305 | arrayhash-tablestring+2 |
| 2334 | Subarray With Elements Greater Than Varying Threshold | Hard | 2381 | arraystackunion-find+1 |
| 2407 | Longest Increasing Subsequence II | Hard | 2280 | arraydivide-and-conquerdynamic-programming+4 |
| 2416 | Sum of Prefix Scores of Strings | Hard | 2003 | arraystringtrie+1 |
| 2421 | Number of Good Paths | Hard | 2445 | arrayhash-tabletree+3 |
| 2426 | Number of Pairs Satisfying Inequality | Hard | 2030 | arraybinary-searchdivide-and-conquer+4 |
| 2642 | Design Graph With Shortest Path Calculator | Hard | 1811 | graphdesignheap-priority-queue+1 |
| 2659 | Make Array Empty | Hard | 2282 | arraybinary-searchgreedy+4 |
| 2736 | Maximum Sum Queries | Hard | 2533 | arraybinary-searchstack+4 |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard | 2327 | arraybinary-searchstack+4 |
| 2945 | Find Maximum Non-decreasing Array Length | Hard | 2943 | arraybinary-searchdynamic-programming+4 |
| 2977 | Minimum Cost to Convert String II | Hard | 2696 | arraystringdynamic-programming+3 |
| 3045 | Count Prefix and Suffix Pairs II | Hard | 2328 | arraystringtrie+3 |
| 3072 | Distribute Elements Into Two Arrays II | Hard | 2053 | arraybinary-indexed-treesegment-tree+1 |
| 3292 | Minimum Number of Valid Strings to Form Target II | Hard | 2662 | arraystringbinary-search+5 |
| 3312 | Sorted GCD Pair Queries | Hard | 2533 | arrayhash-tablemath+5 |
| 3382 | Maximum Area Rectangle With Point Constraints II | Hard | 2723 | arraymathbinary-indexed-tree+3 |
| 3420 | Count Non-Decreasing Subarrays After K Operations | Hard | 2855 | arraystacksegment-tree+4 |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Hard | 2301 | binary-searchgreedyunion-find+2 |
| 3620 | Network Recovery Pathways | Hard | 1998 | arraybinary-searchdynamic-programming+4 |
| 3624 | Number of Integers With Popcount-Depth Equal to K II | Hard | 2086 | arraydivide-and-conquerbinary-indexed-tree+1 |
| 3826 | Minimum Partition Score | Hard | 2345 | arraydivide-and-conquerdynamic-programming+3 |
| 3845 | Maximum Subarray XOR with Bounded Range | Hard | 2347 | arraybit-manipulationtrie+4 |