| 17 | Letter Combinations of a Phone Number | — | Medium | Hash TableStringBacktracking | 64% | |
| 22 | Generate Parentheses | — | Medium | StringDynamic ProgrammingBacktracking | 77% | |
| 37 | Sudoku Solver | — | Hard | ArrayHash TableBacktracking | 64% | |
| 39 | Combination Sum | — | Medium | ArrayBacktracking | 74% | |
| 40 | Combination Sum II | — | Medium | ArrayBacktracking | 58% | |
| 46 | Permutations | — | Medium | ArrayBacktracking | 81% | |
| 47 | Permutations II | — | Medium | ArrayBacktrackingSorting | 61% | |
| 51 | N-Queens | — | Hard | ArrayBacktracking | 72% | |
| 52 | N-Queens II | — | Hard | Backtracking | 77% | |
| 77 | Combinations | — | Medium | Backtracking | 73% | |
| 78 | Subsets | — | Medium | ArrayBacktrackingBit Manipulation | 81% | |
| 79 | Word Search | — | Medium | ArrayStringBacktracking | 45% | |
| 89 | Gray Code | — | Medium | MathBacktrackingBit Manipulation | 62% | |
| 90 | Subsets II | — | Medium | ArrayBacktrackingBit Manipulation | 59% | |
| 93 | Restore IP Addresses | — | Medium | StringBacktracking | 53% | |
| 95 | Unique Binary Search Trees II | — | Medium | Dynamic ProgrammingBacktrackingTree | 60% | |
| 113 | Path Sum II | — | Medium | BacktrackingTreeDepth-First Search | 60% | |
| 126 | Word Ladder II | — | Hard | Hash TableStringBacktracking | 27% | |
| 131 | Palindrome Partitioning | — | Medium | StringDynamic ProgrammingBacktracking | 72% | |
| 140 | Word Break II | — | Hard | ArrayHash TableString | 53% | |
| 212 | Word Search II | — | Hard | ArrayStringBacktracking | 37% | |
| 216 | Combination Sum III | — | Medium | ArrayBacktracking | 72% | |
| 257 | Binary Tree Paths | — | Easy | StringBacktrackingTree | 66% | |
| 282 | Expression Add Operators | — | Hard | MathStringBacktracking | 41% | |
| 301 | Remove Invalid Parentheses | — | Hard | StringBacktrackingBreadth-First Search | 49% | |
| 306 | Additive Number | — | Medium | StringBacktracking | 32% | |
| 401 | Binary Watch | — | Easy | BacktrackingBit Manipulation | 56% | |
| 473 | Matchsticks to Square | — | Medium | ArrayDynamic ProgrammingBacktracking | 41% | |
| 491 | Non-decreasing Subsequences | — | Medium | ArrayHash TableBacktracking | 62% | |
| 494 | Target Sum | — | Medium | ArrayDynamic ProgrammingBacktracking | 51% | |
| 526 | Beautiful Arrangement | — | Medium | ArrayDynamic ProgrammingBacktracking | 64% | |
| 638 | Shopping Offers | — | Medium | ArrayDynamic ProgrammingBacktracking | 52% | |
| 679 | 24 Game | — | Hard | ArrayMathBacktracking | 50% | |
| 691 | Stickers to Spell Word | — | Hard | ArrayHash TableString | 50% | |
| 698 | Partition to K Equal Sum Subsets | — | Medium | ArrayDynamic ProgrammingBacktracking | 38% | |
| 773 | Sliding Puzzleread | — | Hard | ArrayDynamic ProgrammingBacktracking | 73% | |
| 784 | Letter Case Permutation | — | Medium | StringBacktrackingBit Manipulation | 75% | |
| 797 | All Paths From Source to Target | — | Medium | BacktrackingDepth-First SearchBreadth-First Search | 83% | |
| 816 | Ambiguous Coordinates | — | Medium | StringBacktrackingEnumeration | 56% | |
| 842 | Split Array into Fibonacci Sequence | — | Medium | StringBacktracking | 40% | |
| 949 | Largest Time for Given Digits | — | Medium | ArrayStringBacktracking | 35% | |
| 967 | Numbers With Same Consecutive Differences | — | Medium | BacktrackingBreadth-First Search | 59% | |
| 980 | Unique Paths III | — | Hard | ArrayBacktrackingBit Manipulation | 82% | |
| 988 | Smallest String Starting From Leaf | — | Medium | StringBacktrackingTree | 61% | |
| 996 | Number of Squareful Arrays | — | Hard | ArrayHash TableMath | 50% | |
| 1079 | Letter Tile Possibilities | — | Medium | Hash TableStringBacktracking | 84% | |
| 1096 | Brace Expansion IIread | — | Hard | StringBacktrackingStack | 63% | |
| 1219 | Path with Maximum Gold | — | Medium | ArrayBacktrackingMatrix | 68% | |
| 1238 | Circular Permutation in Binary Representation | — | Medium | MathBacktrackingBit Manipulation | 72% | |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | — | Medium | ArrayStringBacktracking | 54% | |