| 455 | Assign Cookies | Easy | 1148 | arraygreedysorting+1 |
| 456 | 132 Pattern | Medium | 1804 | arraybinary-searchstack+2 |
| 460 | LFU Cache | Hard | — | hash-tablelinked-listdesign+1 |
| 461 | Hamming Distance | Easy | 1085 | bit-manipulation |
| 463 | Island Perimeter | Easy | — | arraydepth-first-searchbreadth-first-search+1 |
| 472 | Concatenated Words | Hard | 1945 | arraystringdynamic-programming+2 |
| 473 | Matchsticks to Square | Medium | — | arraydynamic-programmingbacktracking+2 |
| 474 | Ones and Zeroes | Medium | — | arraystringdynamic-programming |
| 477 | Total Hamming Distance | Medium | 1489 | arraymathbit-manipulation |
| 478 | Generate Random Point in a Circle | Medium | — | mathgeometryrejection-sampling+1 |
| 486 | Predict the Winner | Medium | — | arraymathdynamic-programming+2 |
| 493 | Reverse Pairs | Hard | — | arraybinary-searchdivide-and-conquer+4 |
| 494 | Target Sum | Medium | 1679 | arraydynamic-programmingbacktracking |
| 495 | Teemo Attacking | Easy | 1323 | arraysimulation |
| 496 | Next Greater Element I | Easy | 1318 | arrayhash-tablestack+1 |
| 497 | Random Point in Non-overlapping Rectangles | Medium | — | arraymathbinary-search+4 |
| 501 | Find Mode in Binary Search Tree | Easy | — | treedepth-first-searchbinary-search-tree+1 |
| 502 | IPO | Hard | 2099 | arraygreedysorting+1 |
| 503 | Next Greater Element II | Medium | 1513 | arraystackmonotonic-stack |
| 504 | Base 7 | Easy | 1166 | math |
| 509 | Fibonacci Number | Easy | 1177 | dynamic-programmingmathmemoization+1 |
| 513 | Find Bottom Left Tree Value | Medium | — | treedepth-first-searchbreadth-first-search+1 |
| 516 | Longest Palindromic Subsequence | Medium | — | stringdynamic-programming |
| 518 | Coin Change II | Medium | 1697 | arraydynamic-programming |
| 523 | Continuous Subarray Sum | Medium | 1748 | arrayhash-tablemath+1 |
| 525 | Contiguous Array | Medium | 1708 | arrayhash-tableprefix-sum |
| 526 | Beautiful Arrangement | Medium | 1591 | backtrackingbit-manipulation |
| 528 | Random Pick with Weight | Medium | 1416 | arraymathbinary-search+2 |
| 530 | Minimum Absolute Difference in BST | Easy | 1207 | treedepth-first-searchbreadth-first-search+2 |
| 535 | Encode and Decode TinyURL | Medium | — | hash-tablestringdesign+1 |
| 538 | Convert BST to Greater Tree | Medium | — | treedepth-first-searchbinary-search-tree+1 |
| 540 | Single Element in a Sorted Array | Medium | — | arraybinary-search |
| 542 | 01 Matrix | Medium | 1538 | arraydynamic-programmingbreadth-first-search+1 |
| 543 | Diameter of Binary Tree | Easy | 1287 | treedepth-first-searchbinary-tree |
| 547 | Number of Provinces | Medium | 1400 | graphdfsunion-find |
| 554 | Brick Wall | Medium | 1483 | arrayhash-table |
| 560 | Subarray Sum Equals K | Medium | 1621 | arrayhash-tableprefix-sum |
| 567 | Permutation in String | Medium | 1584 | hash-tabletwo-pointersstring+1 |
| 572 | Subtree of Another Tree | Easy | 1377 | treedepth-first-searchstring-matching+2 |
| 588 | Design In-Memory File System | Hard | 1894 | hash-tablestringdesign+1 |
| 605 | Can Place Flowers | Easy | 1320 | arraygreedy |
| 606 | Construct String from Binary Tree | Medium | — | stringtreedepth-first-search+1 |
| 617 | Merge Two Binary Trees | Easy | — | treedepth-first-searchbreadth-first-search+1 |
| 621 | Task Scheduler | Medium | 1667 | arrayhash-tablegreedy+3 |
| 622 | Design Circular Queue | Medium | — | arraylinked-listdesign+1 |
| 632 | Smallest Range Covering Elements from K Lists | Hard | 2093 | arrayhash-tablegreedy+3 |
| 637 | Average of Levels in Binary Tree | Easy | 1186 | treedepth-first-searchbreadth-first-search+1 |
| 641 | Design Circular Deque | Medium | — | arraylinked-listdesign+1 |
| 643 | Maximum Average Subarray I | Easy | 1226 | arraysliding-window |
| 646 | Maximum Length of Pair Chain | Medium | 1544 | arraydynamic-programminggreedy+1 |