| # | Title | Difficulty | Topics | Solution |
|---|
| 45 | Jump Game II | Medium | <DP> | [Solution] |
| 55 | Jump Game | Medium | <DP> | [Solution] |
| 62 | Unique Paths | Medium | <DP> | [Solution] |
| 64 | Minimum Path Sum | Medium | <DP> | [Solution] |
| 70 | Climbing Stairs | Easy | <DP> | [Solution] |
| 238 | Product of Array Except Self | Medium | <Prefix / Suffix> | [Solution] |
| 343 | Integer Break | Medium | <DP> | [Solution] |
| 413 | Arithmetic Slices | Medium | <DP> | [Solution] |
| 463 | Island Perimeter | Easy | <DFS> <BFS> | [Solution] |
| 562 | Longest Line of Consecutive One in Matrix | Medium | <DP> | [Solution] |
| 1182 | Shortest Distance to Target Color | Medium | <DP> | [Solution] |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | <Stack> <String> | [Solution] |
| 2022 | Convert 1D Array Into 2D Array | Easy | | [Solution] |
| 2023 | Number of Pairs of Strings With Concatenation Equal to Target | Medium | <Hash Table> <String> | [Solution] |
| 2024 | Maximize the Confusion of an Exam | Medium | <Sliding Window> | [Solution] |
| 2027 | Minimum Moves to Convert String | Easy | <String> | [Solution] |
| 2028 | Find Missing Observations | Medium | <Math> | [Solution] |
| 2032 | Two Out of Three | Easy | <Hash Table> | [Solution] |
| 2033 | Minimum Operations to Make a Uni-Value Grid | Medium | <Sort> <Math> | [Solution] |
| 2034 | Stock Price Fluctuation | Medium | <Hash Table> <Set> | [Solution] |
| 2036 | Maximum Alternating Subarray Sum | Medium | <DP> | [Solution] |
| 2037 | Minimum Number of Moves to Seat Everyone | Easy | <Sort> | [Solution] |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | Medium | <Greedy> <Math> <Game> | [Solution] |
| 2039 | The Time When the Network Becomes Idle | Medium | <BFS> <Graph> <Shortest Path> | [Solution] |
| 2042 | Check if Numbers Are Ascending in a Sentence | Easy | <Greedy> <String> | [Solution] |
| 2043 | Simple Bank System | Medium | <Hash Table> | [Solution] |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | <Hash Table> <Bit> | [Solution] |
| 2047 | Number of Valid Words in a Sentence | Easy | <Greedy> <String> | [Solution] |
| 2048 | Next Greater Numerically Balanced Number | Medium | <Brute Force> | [Solution] |
| 2049 | Count Nodes With the Highest Score | Medium | <BFS> <Tree> | [Solution] |
| 2050 | Parallel Courses III | Hard | <Graph> <Topo-Sort> | [Solution] |
| 2053 | Kth Distinct String in an Array | Easy | <Hash Table> | [Solution] |
| 2054 | Two Best Non-Overlapping Events | Medium | <Sort> <Heap> | [Solution] |
| 2055 | Plates Between Candles | Medium | <Prefix / Suffix> | [Solution] |
| 2057 | Smallest Index With Equal Value | Easy | <Greedy> | [Solution] |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | <Greedy> <List> | [Solution] |
| 2059 | Minimum Operations to Convert Number | Medium | <BFS> | [Solution] |
| 2062 | Count Vowel Substrings of a String | Easy | <Brute Force> <Sliding Window> <String> | [Solution] |
| 2063 | Vowels of All Substrings | Medium | <Count> <String> | [Solution] |
| 2064 | Minimized Maximum of Products Distributed to Any Store | Medium | <Binary Search> | [Solution] |
| 2065 | Maximum Path Quality of a Graph | Hard | <Graph> <DFS> | [Solution] |
| 2068 | Check Whether Two Strings are Almost Equivalent | Easy | <Hash Table> | [Solution] |
| 2069 | Walking Robot Simulation II | Medium | <Simulation> | [Solution] |
| 2070 | Most Beautiful Item for Each Query | Medium | <Sort> <Hash Table> | [Solution] |
| 2073 | Time Needed to Buy Tickets | Easy | <Math> <Simulation> | [Solution] |
| 2074 | Reverse Nodes in Even Length Groups | Medium | <List> <Stack> | [Solution] |
| 2075 | Decode the Slanted Ciphertext | Medium | <String> | [Solution] |
| 2076 | Process Restricted Friend Requests | Hard | <Union Find> | [Solution] |