Patterns
backtracking
22 problems
# | Title | Acceptance | Difficulty |
|---|---|---|---|
1 | binary tree tree depth first search recursion +1 more | 56.9% | Med. |
2 | binary tree tree depth first search recursion +1 more | 24.5% | Med. |
3 | subsets backtracking array +1 more | 60.3% | easy |
4 | subsets backtracking array +2 more | 40.3% | easy |
5 | backtracking recursion subsets +2 more | 58.8% | Med. |
6 | subsets backtracking recursion +2 more | 56.7% | Med. |
7 | backtracking recursion string | 27.9% | hard |
8 | subsets backtracking recursion +2 more | 70.3% | hard |
9 | binary search tree recursion dynamic programming +2 more | 30.0% | hard |
10 | string recursion two pointers +1 more | 33.1% | easy |
11 | dynamic programming 0/1 knapsack subsets +3 more | 42.8% | Med. |
12 | 0/1 knapsack dynamic programming array +2 more | 35.0% | Med. |
13 | subsets dynamic programming 0/1 knapsack +2 more | 55.6% | hard |
14 | backtracking recursion array +2 more | 46.3% | Med. |
15 | depth-first search backtracking graph +2 more | 28.6% | Med. |
16 | backtracking recursion subsets +1 more | 36.3% | Med. |
17 | backtracking string hash set +1 more | 44.3% | Med. |
18 | backtracking recursion matrix +2 more | 74.3% | hard |
19 | trie string depth-first search +3 more | 35.5% | Med. |
20 | dynamic programming array greedy algorithm +2 more | 20.2% | Med. |
21 | dynamic programming recursion string +1 more | 17.2% | Med. |
22 | trie string depth-first search +3 more | 35.5% | Med. |