| 746 | Min Cost Climbing Stairs | ArrayDynamic Programming | Easy |
| 747 | Largest Number At Least Twice of Others | ArraySorting | Easy |
| 748 | Shortest Completing Word | ArrayHash TableString | Easy |
| 749 | Contain Virus | ArrayDepth-First SearchBreadth-First Search+2 | Hard |
| 752 | Open the Lock | ArrayHash TableString+1 | Medium |
| 753 | Cracking the Safe | Depth-First SearchGraphEulerian Circuit | Hard |
| 754 | Reach a Number | MathBinary Search | Medium |
| 756 | Pyramid Transition Matrix | Bit ManipulationDepth-First SearchBreadth-First Search | Medium |
| 757 | Set Intersection Size At Least Two | ArrayGreedySorting | Hard |
| 761 | Special Binary String | StringRecursion | Hard |
| 762 | Prime Number of Set Bits in Binary Representation | MathBit Manipulation | Easy |
| 763 | Partition Labels | Hash TableTwo PointersString+1 | Medium |
| 764 | Largest Plus Sign | ArrayDynamic Programming | Medium |
| 765 | Couples Holding Hands | GreedyDepth-First SearchBreadth-First Search+2 | Hard |
| 766 | Toeplitz Matrix | ArrayMatrix | Easy |
| 767 | Reorganize String | Hash TableStringGreedy+3 | Medium |
| 768 | Max Chunks To Make Sorted II | ArrayStackGreedy+2 | Hard |
| 769 | Max Chunks To Make Sorted | ArrayStackGreedy+2 | Medium |
| 770 | Basic Calculator IV | Hash TableMathString+2 | Hard |
| 771 | Jewels and Stones | Hash TableString | Easy |
| 773 | Sliding Puzzle | ArrayDynamic ProgrammingBacktracking+3 | Hard |
| 775 | Global and Local Inversions | ArrayMath | Medium |
| 777 | Swap Adjacent in LR String | Two PointersString | Medium |
| 778 | Swim in Rising Water | ArrayBinary SearchDepth-First Search+4 | Hard |
| 779 | K-th Symbol in Grammar | MathBit ManipulationRecursion | Medium |
| 780 | Reaching Points | Math | Hard |
| 781 | Rabbits in Forest | ArrayHash TableMath+1 | Medium |
| 782 | Transform to Chessboard | ArrayMathBit Manipulation+1 | Hard |
| 783 | Minimum Distance Between BST Nodes | TreeDepth-First SearchBreadth-First Search+2 | Easy |
| 784 | Letter Case Permutation | StringBacktrackingBit Manipulation | Medium |
| 785 | Is Graph Bipartite? | Depth-First SearchBreadth-First SearchUnion Find+1 | Medium |
| 786 | K-th Smallest Prime Fraction | ArrayTwo PointersBinary Search+2 | Medium |
| 787 | Cheapest Flights Within K Stops | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 | Medium |
| 788 | Rotated Digits | MathDynamic Programming | Medium |
| 789 | Escape The Ghosts | ArrayMath | Medium |
| 790 | Domino and Tromino Tiling | Dynamic Programming | Medium |
| 791 | Custom Sort String | Hash TableStringSorting | Medium |
| 792 | Number of Matching Subsequences | ArrayHash TableString+4 | Medium |
| 793 | Preimage Size of Factorial Zeroes Function | MathBinary Search | Hard |
| 794 | Valid Tic-Tac-Toe State | ArrayMatrix | Medium |
| 795 | Number of Subarrays with Bounded Maximum | ArrayTwo Pointers | Medium |
| 796 | Rotate String | StringString Matching | Easy |
| 797 | All Paths From Source to Target | BacktrackingDepth-First SearchBreadth-First Search+1 | Medium |
| 798 | Smallest Rotation with Highest Score | ArrayPrefix Sum | Hard |
| 799 | Champagne Tower | Dynamic Programming | Medium |
| 801 | Minimum Swaps To Make Sequences Increasing | ArrayDynamic Programming | Hard |
| 802 | Find Eventual Safe States | Depth-First SearchBreadth-First SearchGraph+1 | Medium |
| 803 | Bricks Falling When Hit | ArrayUnion FindMatrix | Hard |
| 804 | Unique Morse Code Words | ArrayHash TableString | Easy |
| 805 | Split Array With Same Average | ArrayMathDynamic Programming+2 | Hard |