Python Algorithms Traing Basic
latest
chapter 1: Array
chapter 2: Backtracking
Backtracking - Easy
Backtracking - Medium
Backtracking - Hard
chapter 3: Binary Search
chapter 4: Bit manipulation
chapter 5: Breadth First Search
chapter 6: Combination
chapter 7: Depth First Search
chapter 8: DFA
chapter 9: DivideConquer
chapter 10: Dynamic Programming
chapter 11: Graph
chapter 12: Greedy
chapter 13: Hash table
chapter 14: Heap
chapter 15: Linked List
chapter 16: Math
chapter 17: Others
chapter 18: Recursion
chapter 19: Stack
chapter 20: String
chapter 21: ToBeOptimized
chapter 22: Tree
chapter 23: Two Pointers
Python Algorithms Traing Basic
Docs
»
chapter 2: Backtracking
Edit on GitHub
chapter 2: Backtracking
¶
Backtracking - Easy
22. generate-parentheses
39. Combination Sum
40. Combination Sum 2
46. Permutations
47. Permutation 2
51. NQueens
52. N-Queens 2
79. Word Search
90. Subsets 2
93. Restore IP Addresses
131. Palindrome-partitioning
216. Combination Sum 3
Backtracking - Medium
Backtracking - Hard