Home

LeetCode knakul853

1. Backtracking : Idea: check the current position and explore all the next position if this lead to good combination accept the answer otherwise backtrack wait .... what?

### **problems: **

• 0.                     https://leetcode.com/problems/path-with-maximum-gold/
     

• 1.                     https://leetcode.com/problems/permutations/
     

• 2.                     https://leetcode.com/problems/generate-parentheses/
     

• 3.                     https://leetcode.com/problems/subsets/
     

• 4.                     https://leetcode.com/problems/beautiful-arrangement/
     

• 5.                     https://leetcode.com/problems/combination-sum/
     

• 6.                     https://leetcode.com/problems/combination-sum-iii/
     

• 7.                     https://leetcode.com/problems/combinations/
     

• 8.                     https://leetcode.com/problems/count-numbers-with-unique-digits/
     

• 9.                     https://leetcode.com/problems/gray-code/
     

• 10.                    https://leetcode.com/problems/combination-sum-ii/
      

• 11.                    https://leetcode.com/problems/subsets-ii/
      

• 12.                    https://leetcode.com/problems/sequential-digits/
      

• 13.                    https://leetcode.com/problems/letter-combinations-of-a-phone-number/
      

• 14.                    https://leetcode.com/problems/palindrome-partitioning/