| 1425 | Constrained Subsequence Sum | Hard | 2032 | arraydynamic-programmingqueue+3 |
| 1431 | Kids With the Greatest Number of Candies | Easy | 1118 | arraygreedy |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 1672 | arrayqueuesliding-window+3 |
| 1443 | Minimum Time to Collect All Apples in a Tree | Medium | 1683 | hash-tabletreedepth-first-search+1 |
| 1448 | Count Good Nodes in Binary Tree | Medium | 1438 | treedepth-first-searchbreadth-first-search+1 |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | Medium | 1263 | stringsliding-window |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium | 1504 | hash-tablestringbit-manipulation+2 |
| 1462 | Course Schedule IV | Medium | 1693 | depth-first-searchbreadth-first-searchgraph+1 |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | 1634 | graphdfsbfs |
| 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | Hard | 2357 | arraymathdynamic-programming+3 |
| 1470 | Shuffle the Array | Easy | 1121 | array |
| 1472 | Design Browser History | Medium | 1454 | arraylinked-liststack+3 |
| 1475 | Final Prices With a Special Discount in a Shop | Easy | 1225 | arraystackmonotonic-stack |
| 1480 | Running Sum of 1d Array | Easy | 1133 | arrayprefix-sum |
| 1486 | XOR Operation in an Array | Easy | 1176 | bit-manipulationmath |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | 2572 | union-findgraphsorting+2 |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium | 1423 | sliding-windowarraydynamic-programming |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | 2276 | arraytwo-pointersbinary-search+1 |
| 1499 | Max Value of Equation | Hard | 2456 | arrayqueuesliding-window+2 |
| 1505 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Hard | 2337 | stringgreedybinary-indexed-tree+1 |
| 1514 | Path with Maximum Probability | Medium | 1846 | arraygraphheap-priority-queue+1 |
| 1515 | Best Position for a Service Centre | Hard | 2157 | arraymathgeometry+1 |
| 1523 | Count Odd Numbers in an Interval Range | Easy | 1209 | math |
| 1545 | Find Kth Bit in Nth Binary String | Medium | 1479 | stringrecursionsimulation |
| 1547 | Minimum Cost to Cut a Stick | Hard | 2116 | arraydynamic-programmingsorting |
| 1553 | Minimum Number of Days to Eat N Oranges | Hard | 2048 | dynamic-programmingmemoization |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium | 1512 | graph |
| 1569 | Number of Ways to Reorder Array to Get Same BST | Hard | 2288 | arraymathdivide-and-conquer+7 |
| 1572 | Matrix Diagonal Sum | Easy | 1280 | arraymatrix |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | 2132 | union-findgraph |
| 1584 | Min Cost to Connect All Points | Medium | 1605 | arrayunion-findgraph+1 |
| 1591 | Strange Printer II | Hard | 2291 | arraygraphtopological-sort+1 |
| 1603 | Design Parking System | Easy | 1324 | designsimulationcounting |
| 1606 | Find Servers That Handled Most Number of Requests | Hard | 2276 | arrayheap-priority-queuesimulation+1 |
| 1609 | Even Odd Tree | Medium | 1749 | treebfsbinary-tree |
| 1622 | Fancy Sequence | Hard | 2476 | mathdesignsegment-tree |
| 1626 | Best Team With No Conflicts | Medium | 2027 | arraydynamic-programmingsorting |
| 1627 | Graph Connectivity With Threshold | Hard | 2221 | arraymathunion-find+1 |
| 1631 | Path With Minimum Effort | Medium | 1947 | arraybinary-searchdepth-first-search+4 |
| 1632 | Rank Transform of a Matrix | Hard | 2530 | arrayunion-findgraph+3 |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard | 2082 | arraystringdynamic-programming |
| 1642 | Furthest Building You Can Reach | Medium | 1536 | arraygreedyheap-priority-queue |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | 1510 | hash-tablestringgreedy+1 |
| 1649 | Create Sorted Array through Instructions | Hard | 2208 | arraybinary-searchdivide-and-conquer+4 |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | — | treehash-tabletwo-pointers |
| 1655 | Distribute Repeating Integers | Hard | 2307 | arrayhash-tabledynamic-programming+4 |
| 1656 | Design an Ordered Stream | Easy | 1419 | arrayhash-tabledesign+1 |
| 1657 | Determine if Two Strings Are Close | Medium | 1530 | hash-tablestringsorting+1 |
| 1658 | Minimum Operations to Reduce X to Zero | Medium | 1817 | arrayhash-tablebinary-search+3 |
| 1670 | Design Front Middle Back Queue | Medium | 1610 | arraylinked-listdesign+3 |