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:**


                     https://leetcode.com/problems/path-with-maximum-gold/
                     https://leetcode.com/problems/permutations/
                     https://leetcode.com/problems/generate-parentheses/
                     https://leetcode.com/problems/subsets/
                     https://leetcode.com/problems/beautiful-arrangement/
                     https://leetcode.com/problems/combination-sum/
                     https://leetcode.com/problems/combination-sum-iii/
                     https://leetcode.com/problems/combinations/
                     https://leetcode.com/problems/count-numbers-with-unique-digits/
                     https://leetcode.com/problems/gray-code/
                    https://leetcode.com/problems/combination-sum-ii/
                    https://leetcode.com/problems/subsets-ii/
                    https://leetcode.com/problems/sequential-digits/
                    https://leetcode.com/problems/letter-combinations-of-a-phone-number/
                    https://leetcode.com/problems/palindrome-partitioning/
                     https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/
                   https://leetcode.com/problems/permutations-ii
                   https://leetcode.com/problems/split-array-into-fibonacci-sequence/
                   https://leetcode.com/problems/permutation-sequence/
                   https://leetcode.com/problems/word-search/