| 486 | Predict the Winner | ArrayMathDynamic Programming+2 | Medium |
| 488 | Zuma Game | StringDynamic ProgrammingStack+2 | Hard |
| 491 | Non-decreasing Subsequences | ArrayHash TableBacktracking+1 | Medium |
| 492 | Construct the Rectangle | Math | Easy |
| 493 | Reverse Pairs | ArrayBinary SearchDivide and Conquer+4 | Hard |
| 494 | Target Sum | ArrayDynamic ProgrammingBacktracking | Medium |
| 495 | Teemo Attacking | ArraySimulation | Easy |
| 496 | Next Greater Element I | ArrayHash TableStack+1 | Easy |
| 497 | Random Point in Non-overlapping Rectangles | ArrayMathBinary Search+4 | Medium |
| 498 | Diagonal Traverse | ArrayMatrixSimulation | Medium |
| 500 | Keyboard Row | ArrayHash TableString | Easy |
| 501 | Find Mode in Binary Search Tree | TreeDepth-First SearchBinary Search Tree+1 | Easy |
| 502 | IPO | ArrayGreedySorting+1 | Hard |
| 503 | Next Greater Element II | ArrayStackMonotonic Stack | Medium |
| 504 | Base 7 | MathString | Easy |
| 506 | Relative Ranks | ArraySortingHeap (Priority Queue) | Easy |
| 507 | Perfect Number | Math | Easy |
| 508 | Most Frequent Subtree Sum | Hash TableTreeDepth-First Search+1 | Medium |
| 509 | Fibonacci Number | MathDynamic ProgrammingRecursion+1 | Easy |
| 511 | Game Play Analysis I | Database | Easy |
| 513 | Find Bottom Left Tree Value | TreeDepth-First SearchBreadth-First Search+1 | Medium |
| 514 | Freedom Trail | StringDynamic ProgrammingDepth-First Search+1 | Hard |
| 515 | Find Largest Value in Each Tree Row | TreeDepth-First SearchBreadth-First Search+1 | Medium |
| 516 | Longest Palindromic Subsequence | StringDynamic Programming | Medium |
| 517 | Super Washing Machines | ArrayGreedy | Hard |
| 518 | Coin Change II | ArrayDynamic Programming | Medium |
| 519 | Random Flip Matrix | Hash TableMathReservoir Sampling+1 | Medium |
| 520 | Detect Capital | String | Easy |
| 521 | Longest Uncommon Subsequence I | String | Easy |
| 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 |
| 530 | Minimum Absolute Difference in BST | TreeDepth-First SearchBreadth-First Search+2 | Easy |
| 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 |
| 539 | Minimum Time Difference | ArrayMathString+1 | Medium |
| 540 | Single Element in a Sorted Array | ArrayBinary Search | Medium |
| 541 | Reverse String II | Two PointersString | Easy |
| 542 | 01 Matrix | ArrayDynamic ProgrammingBreadth-First Search+1 | Medium |
| 543 | Diameter of Binary Tree | TreeDepth-First SearchBinary Tree | Easy |
| 546 | Remove Boxes | ArrayDynamic ProgrammingMemoization | Hard |
| 547 | Number of Provinces | Depth-First SearchBreadth-First SearchUnion Find+1 | Medium |
| 550 | Game Play Analysis IV | Database | Medium |
| 551 | Student Attendance Record I | String | Easy |