76 Letter combinations of phone Medium Backtrack+Prune

Given phone number digits, list all possible letter combinations from the keypad (like T9).

O(4^n) time · O(n) space
77 Permutations Medium Backtrack+Prune

Generate every possible ordering of a list of distinct numbers.

O(n * n!) time · O(n) space
78 Combinations Medium Backtrack+Prune

List all ways to choose k numbers from 1 to n (order does not matter).

O(C(n,k) * k) time · O(k) space
79 Combination sum Medium Backtrack+Prune

Find all ways to pick numbers from a list (reuse allowed) that add up to a target sum.

O(n^(target/min)) time · O(target/min) space
80 N-Queens (4x4) Medium Backtrack+Prune

Place 4 queens on a 4x4 chessboard so none can attack another (no shared row, column, or diagonal).

O(n!) time · O(n) space
81 Word search Medium Backtrack+Prune

Check if you can spell a word by tracing a path through adjacent cells in a grid (each cell used once).

O(m*n*4^L) time · O(L) space
82 Palindrome partitioning Medium Backtrack+Prune

Split a string into pieces where every piece reads the same forwards and backwards.

O(n * 2^n) time · O(n) space
136 Generate Parentheses Medium Constrained Generation

Generate every possible way to arrange n pairs of parentheses so they're all properly matched.

O(4^n / sqrt(n)) time · O(n) space (recursion depth)