| 427 | Construct Quad Tree | ArrayDivide and ConquerTree+1 | Medium |
| 429 | N-ary Tree Level Order Traversal | TreeBreadth-First Search | Medium |
| 430 | Flatten a Multilevel Doubly Linked List | Linked ListDepth-First SearchDoubly-Linked List | Medium |
| 432 | All O`one Data Structure | Hash TableLinked ListDesign+1 | Hard |
| 433 | Minimum Genetic Mutation | Hash TableStringBreadth-First Search | Medium |
| 434 | Number of Segments in a String | String | Easy |
| 435 | Non-overlapping Intervals | ArrayDynamic ProgrammingGreedy+1 | Medium |
| 437 | Path Sum III | TreeDepth-First SearchBinary Tree | Medium |
| 438 | Find All Anagrams in a String | Hash TableStringSliding Window | Medium |
| 440 | K-th Smallest in Lexicographical Order | Trie | Hard |
| 441 | Arranging Coins | MathBinary Search | Easy |
| 442 | Find All Duplicates in an Array | ArrayHash Table | Medium |
| 443 | String Compression | Two PointersString | Medium |
| 445 | Add Two Numbers II | Linked ListMathStack | Medium |
| 446 | Arithmetic Slices II - Subsequence | ArrayDynamic Programming | Hard |
| 447 | Number of Boomerangs | ArrayHash TableMath | Medium |
| 448 | Find All Numbers Disappeared in an Array | ArrayHash Table | Easy |
| 449 | Serialize and Deserialize BST | StringTreeDepth-First Search+4 | Medium |
| 450 | Delete Node in a BST | TreeBinary Search TreeBinary Tree | Medium |
| 451 | Sort Characters By Frequency | Hash TableStringSorting+3 | Medium |
| 452 | Minimum Number of Arrows to Burst Balloons | ArrayGreedySorting | Medium |
| 453 | Minimum Moves to Equal Array Elements | ArrayMath | Medium |
| 454 | 4Sum II | ArrayHash Table | Medium |
| 455 | Assign Cookies | ArrayTwo PointersGreedy+1 | Easy |
| 456 | 132 Pattern | ArrayBinary SearchStack+2 | Medium |
| 457 | Circular Array Loop | ArrayHash TableTwo Pointers | Medium |
| 458 | Poor Pigs | MathDynamic ProgrammingCombinatorics | Hard |
| 459 | Repeated Substring Pattern | StringString Matching | Easy |
| 460 | LFU Cache | Hash TableLinked ListDesign+1 | Hard |
| 461 | Hamming Distance | Bit Manipulation | Easy |
| 462 | Minimum Moves to Equal Array Elements II | ArrayMathSorting | Medium |
| 463 | Island Perimeter | ArrayDepth-First SearchBreadth-First Search+1 | Easy |
| 464 | Can I Win | MathDynamic ProgrammingBit Manipulation+3 | Medium |
| 466 | Count The Repetitions | StringDynamic Programming | Hard |
| 467 | Unique Substrings in Wraparound String | StringDynamic Programming | Medium |
| 468 | Validate IP Address | String | Medium |
| 470 | Implement Rand10() Using Rand7() | MathRejection SamplingRandomized+1 | Medium |
| 472 | Concatenated Words | ArrayStringDynamic Programming+3 | Hard |
| 473 | Matchsticks to Square | ArrayDynamic ProgrammingBacktracking+2 | Medium |
| 474 | Ones and Zeroes | ArrayStringDynamic Programming | Medium |
| 475 | Heaters | ArrayTwo PointersBinary Search+1 | Medium |
| 476 | Number Complement | Bit Manipulation | Easy |
| 477 | Total Hamming Distance | ArrayMathBit Manipulation | Medium |
| 478 | Generate Random Point in a Circle | MathGeometryRejection Sampling+1 | Medium |
| 479 | Largest Palindrome Product | MathEnumeration | Hard |
| 480 | Sliding Window Median | ArrayHash TableSliding Window+1 | Hard |
| 481 | Magical String | Two PointersString | Medium |
| 482 | License Key Formatting | String | Easy |
| 483 | Smallest Good Base | MathBinary Search | Hard |
| 485 | Max Consecutive Ones | Array | Easy |