DSA sheet · Topic
Backtracking interview problems
Building every candidate answer one choice at a time, and undoing the choice to try the next: subsets, permutations, combinations and boards.
- 10 problems
- Java + Python
- Free, no sign-up
10 Backtracking Building every candidate answer one choice at a time, and undoing the choice to try the next: subsets, permutations, combinations and boards. 0 / 10
- 85 Subsets Medium Has notes Practice Subsets on LeetCode (opens in a new tab)
- 86 Subsets II Medium Has notes Practice Subsets II on LeetCode (opens in a new tab)
- 87 Permutations Medium Has notes Practice Permutations on LeetCode (opens in a new tab)
- 88 Combination Sum Medium Has notes Practice Combination Sum on LeetCode (opens in a new tab)
- 89 Combination Sum II Medium Has notes Practice Combination Sum II on LeetCode (opens in a new tab)
- 90 Letter Combinations of a Phone Number Medium Has notes Practice Letter Combinations of a Phone Number on LeetCode (opens in a new tab)
- 91 Generate Parentheses Medium Has notes Practice Generate Parentheses on LeetCode (opens in a new tab)
- 92 Word Search Medium Has notes Practice Word Search on LeetCode (opens in a new tab)
- 93 Palindrome Partitioning Medium Has notes Practice Palindrome Partitioning on LeetCode (opens in a new tab)
- 94 N-Queens Hard Has notes Practice N-Queens on LeetCode (opens in a new tab)
No problems match these filters.