| 2642 | Design Graph With Shortest Path Calculator | Hard | 1811 | graphdesignheap-priority-queue+1 |
| 2659 | Make Array Empty | Hard | 2282 | arraybinary-searchgreedy+4 |
| 2662 | Minimum Cost of a Path With Special Roads | Medium | 2154 | arraygraphheap-priority-queue+1 |
| 2685 | Count the Number of Complete Components | Medium | 1769 | depth-first-searchbreadth-first-searchunion-find+1 |
| 2736 | Maximum Sum Queries | Hard | 2533 | arraybinary-searchstack+4 |
| 2762 | Continuous Subarrays | Medium | 1940 | arrayqueuesliding-window+3 |
| 2865 | Beautiful Towers I | Medium | 1550 | arraystackmonotonic-stack |
| 2866 | Beautiful Towers II | Medium | 1974 | arraystackmonotonic-stack |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard | 2327 | arraybinary-searchstack+4 |
| 2944 | Minimum Number of Coins for Fruits | Medium | 1709 | arraydynamic-programmingqueue+2 |
| 2945 | Find Maximum Non-decreasing Array Length | Hard | 2943 | arraybinary-searchdynamic-programming+4 |
| 2976 | Minimum Cost to Convert String I | Medium | 1882 | arraystringgraph+1 |
| 2977 | Minimum Cost to Convert String II | Hard | 2696 | arraystringdynamic-programming+3 |
| 3042 | Count Prefix and Suffix Pairs I | Easy | 1214 | arraystringtrie+3 |
| 3044 | Most Frequent Prime | Medium | 1737 | arrayhash-tablemath+4 |
| 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 |
| 3112 | Minimum Time to Visit Disappearing Nodes | Medium | 1757 | arraygraphheap-priority-queue+1 |
| 3128 | Right Triangles | Medium | 1541 | arrayhash-tablemath+2 |
| 3179 | Find the N-th Value After K Seconds | Medium | 1369 | arraymathsimulation+2 |
| 3222 | Find the Winning Player in Coin Game | Easy | 1270 | mathsimulationgame-theory |
| 3286 | Find a Safe Walk Through a Grid | Medium | 1608 | arraybreadth-first-searchgraph+3 |
| 3291 | Minimum Number of Valid Strings to Form Target I | Medium | 2082 | arraystringbinary-search+6 |
| 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 |
| 3341 | Find Minimum Time to Reach Last Room I | Medium | 1721 | arraygraphheap-priority-queue+2 |
| 3342 | Find Minimum Time to Reach Last Room II | Medium | 1862 | arraygraphheap-priority-queue+2 |
| 3377 | Digit Operations to Make Two Integers Equal | Medium | 2186 | mathgraphheap-priority-queue+2 |
| 3380 | Maximum Area Rectangle With Point Constraints I | Medium | 1743 | arraymathbinary-indexed-tree+4 |
| 3382 | Maximum Area Rectangle With Point Constraints II | Hard | 2723 | arraymathbinary-indexed-tree+3 |
| 3408 | Design Task Manager | Medium | 1807 | hash-tabledesignheap-priority-queue+1 |
| 3419 | Minimize the Maximum Edge Weight of Graph | Medium | 2243 | binary-searchdepth-first-searchbreadth-first-search+2 |
| 3420 | Count Non-Decreasing Subarrays After K Operations | Hard | 2855 | arraystacksegment-tree+4 |
| 3461 | Check If Digits Are Equal in String After Operations I | Easy | 1189 | mathstringsimulation+2 |
| 3477 | Fruits Into Baskets II | Easy | 1296 | arraybinary-searchsegment-tree+2 |
| 3479 | Fruits Into Baskets III | Medium | 2178 | arraybinary-searchsegment-tree+1 |
| 3493 | Properties Graph | Medium | 1565 | arrayhash-tabledepth-first-search+3 |
| 3508 | Implement Router | Medium | 1851 | arrayhash-tablebinary-search+3 |
| 3532 | Path Existence Queries in a Graph I | Medium | 1659 | arrayhash-tablebinary-search+2 |
| 3578 | Count Partitions With Max-Min Difference at Most K | Medium | 2033 | arraydynamic-programmingqueue+3 |
| 3589 | Count Prime-Gap Balanced Subarrays | Medium | 2235 | arraymathqueue+3 |
| 3597 | Partition String | Medium | 1347 | hash-tablestringtrie+1 |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Hard | 2301 | binary-searchgreedyunion-find+2 |
| 3604 | Minimum Time to Reach Destination in Directed Graph | Medium | 1845 | graphheap-priority-queueshortest-path |
| 3607 | Power Grid Maintenance | Medium | 1700 | arrayhash-tabledepth-first-search+5 |
| 3608 | Minimum Time for K Connected Components | Medium | 1893 | binary-searchunion-findgraph+1 |
| 3613 | Minimize Maximum Component Cost | Medium | 1642 | binary-searchunion-findgraph+1 |
| 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 |
| 3650 | Minimum Cost Path with Edge Reversals | Medium | 1854 | graphheap-priority-queueshortest-path |