| # | Problem |
|---|---|
| 22 | Generate Parentheses |
| 39 | Combination Sum |
| 40 | Combination Sum ii |
| 46 | Permutations |
| 47 | Permutations ii |
| 60 | Permutation Sequence |
| 77 | Combinations |
| 78 | Subsets |
| 79 | Word Search |
| 90 | Subsets ii |
| 131 | Palindrome Partitioning |
| 797 | All Paths From Source to Target |
| # | Problem |
|---|---|
| 200 | Number of Islands |
| 296 | Best Meeting Point |
| 305 | Number of islands II |
| 490 | The Maze |
| 542 | 01 Matrix |
| 694 | Number of Distinct Islands |
| 994 | Rotting Oranges |
| 1091 | Shortest Path in Binary Matrix |
| # | Problem |
|---|---|
| 136 | Single Number |
| 190 | Reverse Bits |
| 191 | Number of 1 Bits |
| 201 | Bitwise and of Numbers Range |
| 268 | Missing Number |
| 338 | Counting Bits |
| 371 | Sum of Two Integers |
| # | Problem |
|---|---|
| 19 | Remove-Nth-Node-From-End-of-List |
| 61 | Rotate List |
| 86 | Partition List |
| 141 | Linked List Cycle |
| 142 | Linked List Cycle II |
| 143 | Reorder List |
| 160 | Intersection of Two Linked Lists |
| 876 | Middle of the Linked List |
| # | Problem |
|---|---|
| 5 | Longest Palindromic Substring |
| 44 | Wildcard Matching |
| 62 | Unique Paths |
| 63 | Unique Paths II |
| 64 | Minimum Path Sum |
| 70 | Climbing Stairs |
| 72 | Edit Distance |
| 85 | Maximal Rectangle |
| 91 | Decode Ways |
| 139 | Word Break |
| 152 | Maximum Product Subarray |
| 198 | House Robber |
| 213 | House Robber II |
| 279 | perfect Squares |
| 300 | Longest Increasing Subsequence |
| 322 | Coin Change |
| 343 | Integer Break |
| 413 | Arithmetic Slices |
| 416 | Partition Equal Subset Sum |
| 518 | Coin Change 2 |
| 583 | Delete Operation for Two Strings |
| 647 | Palindromic Substrings |
| 673 | Number of Longest Increasing Subsequence |
| 1143 | Longest Common Subsequence |
| 2327 | Number of People Aware of a Secret |
| # | Problem |
|---|---|
| 45 | Jump Game II |
| 53 | Maximum Subarray |
| 55 | Jump Game |
| 122 | Best Time to Buy and Sell Stock II |
| 134 | Gas Station |
| 435 | Non Overlapping Intervals |
| 452 | Minimum Number of Arrows to Burst Balloons |
| 846 | Hand of Straights |
| 2405 | Optimal Partition of String |
| 2332 | The Latest Time to Catch a Bus |
| 2429 | Minimize XOR |
| # | Problem |
|---|---|
| 21 | Merge Two Sorted Lists |
| 23 | Merge k Sorted Lists |
| 24 | Swap Nodes in Pairs |
| 25 | Reverse Nodes in k Group |
| 143 | Reorder List |
| 206 | Reverse Linked List |
| # | Problem |
|---|---|
| 146 | LRU Cache |
| 155 | Min Stack |
| 384 | Shuffle an Array |
| 398 | Random Pick Index |
| 604 | Design Compressed String Iterator |
| # | Problem |
|---|---|
| 1588 | Sum of All Odd Length Subarrays |
| # | Problem |
|---|---|
| 8 | String to Integer atoi |
| 10 | Regular Expression Matching |
| 722 | Remove Comments |
| # | Problem |
|---|---|
| 175 | Combine Two Tables |
| 182 | Duplicate Emails |
| 197 | Rising Temperature |
| # | Problem |
|---|---|
| 20 | Valid Parentheses |
| 71 | Simplify Path |
| 150 | Evaluate Reverse Polish Notation |
| 155 | Min Stack |
| 224 | Basic Calculator |
| 232 | Implement Queue Using Stacks |
| 739 | Daily Temperatures |
| 844 | Backspace String Compare |
| 2289 | Steps to Make Array Non-decreasing |
| 2487 | Remove Nodes From Linked List |
| 2645 | Minimum Additions to Make Valid String |
| # | Problem |
|---|---|
| 8 | String to Integer atoi |
| 38 | Count and Say |
| 187 | Repeated DNA Sequences |
| 242 | Valid Anagram |
| 243 | Shortest Word Distance |
| 249 | Group Shifted Strings |
| 271 | Encode and Decode Strings |
| 293 | Flip Game |
| 344 | Reverse String |
| 1427 | Perform String Shifts |
| 2337 | Move Pieces to Obtain a String |
| # | Problem |
|---|---|
| 208 | Implement Trie (Prefix Tree) |
| 211 | Design Add and Search Words Data Structure |
| 212 | Word Search II |