| 433 | Minimum Genetic Mutation | Hash TableStringBreadth-First Search | Medium |
| 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 |
| 442 | Find All Duplicates in an Array | ArrayHash Table | Medium |
| 443 | String Compression | Two PointersString | Medium |
| 445 | Add Two Numbers II | Linked ListMathStack | Medium |
| 447 | Number of Boomerangs | ArrayHash TableMath | Medium |
| 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 |
| 456 | 132 Pattern | ArrayBinary SearchStack+2 | Medium |
| 457 | Circular Array Loop | ArrayHash TableTwo Pointers | Medium |
| 462 | Minimum Moves to Equal Array Elements II | ArrayMathSorting | Medium |
| 464 | Can I Win | MathDynamic ProgrammingBit Manipulation+3 | Medium |
| 467 | Unique Substrings in Wraparound String | StringDynamic Programming | Medium |
| 468 | Validate IP Address | String | Medium |
| 470 | Implement Rand10() Using Rand7() | MathRejection SamplingRandomized+1 | Medium |
| 473 | Matchsticks to Square | ArrayDynamic ProgrammingBacktracking+2 | Medium |
| 474 | Ones and Zeroes | ArrayStringDynamic Programming | Medium |
| 475 | Heaters | ArrayTwo PointersBinary Search+1 | Medium |
| 477 | Total Hamming Distance | ArrayMathBit Manipulation | Medium |
| 478 | Generate Random Point in a Circle | MathGeometryRejection Sampling+1 | Medium |
| 481 | Magical String | Two PointersString | Medium |
| 486 | Predict the Winner | ArrayMathDynamic Programming+2 | Medium |
| 491 | Non-decreasing Subsequences | ArrayHash TableBacktracking+1 | Medium |
| 494 | Target Sum | ArrayDynamic ProgrammingBacktracking | Medium |
| 497 | Random Point in Non-overlapping Rectangles | ArrayMathBinary Search+4 | Medium |
| 498 | Diagonal Traverse | ArrayMatrixSimulation | Medium |
| 503 | Next Greater Element II | ArrayStackMonotonic Stack | Medium |
| 508 | Most Frequent Subtree Sum | Hash TableTreeDepth-First Search+1 | Medium |
| 513 | Find Bottom Left Tree Value | TreeDepth-First SearchBreadth-First Search+1 | Medium |
| 515 | Find Largest Value in Each Tree Row | TreeDepth-First SearchBreadth-First Search+1 | Medium |
| 516 | Longest Palindromic Subsequence | StringDynamic Programming | Medium |
| 518 | Coin Change II | ArrayDynamic Programming | Medium |
| 519 | Random Flip Matrix | Hash TableMathReservoir Sampling+1 | Medium |
| 522 | Longest Uncommon Subsequence II | ArrayHash TableTwo Pointers+2 | Medium |
| 523 | Continuous Subarray Sum | ArrayHash TableMath+1 | Medium |
| 524 | Longest Word in Dictionary through Deleting | ArrayTwo PointersString+1 | Medium |
| 525 | Contiguous Array | ArrayHash TablePrefix Sum | Medium |
| 526 | Beautiful Arrangement | ArrayDynamic ProgrammingBacktracking+2 | Medium |
| 528 | Random Pick with Weight | ArrayMathBinary Search+2 | Medium |
| 529 | Minesweeper | ArrayDepth-First SearchBreadth-First Search+1 | Medium |
| 532 | K-diff Pairs in an Array | ArrayHash TableTwo Pointers+2 | Medium |
| 535 | Encode and Decode TinyURL | Hash TableStringDesign+1 | Medium |
| 537 | Complex Number Multiplication | MathStringSimulation | Medium |
| 538 | Convert BST to Greater Tree | TreeDepth-First SearchBinary Search Tree+1 | Medium |