Backtracking
Go to ProblemsTime Complexity analysis of recursion
Backtracking Problems
Subsets
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| All Possible Combinations | 200 |
|
37:16 | |
| Subset | 250 |
|
61:56 | |
| Combination Sum | 300 |
|
62:41 | |
| Combination Sum II | 300 |
|
42:05 | |
| Combinations | 300 |
|
46:09 | |
| Subsets II | 300 |
|
41:22 |
Maths and backtracking
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Maximal String | 200 |
|
65:34 | |
| Kth Permutation Sequence | 350 |
|
79:05 | |
| Gray Code | 350 |
|
58:55 |
Bruteforce builder
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Letter Phone | 250 |
|
53:36 | |
| Palindrome Partitioning | 300 |
|
68:22 | |
| Generate all Parentheses II | 350 |
|
52:54 |
Permutations
| Problem | Score | Companies | Time | Status |
|---|---|---|---|---|
| Permutations | 350 |
|
39:38 |
