Backtracking Sequence

After working through the Combination Sum and applying backtracking algorithm. You can solve a series of similar problems.

For instance, in Combination Sum III, you can tweak the invocation of the recursive function to solve the problem, in addition to a few minor adjustments on the base cases.

In Combination Sum problem, we give the current candidate another chance in the further explorations, whereas in Combination Sum III we simply move on to the candidates followed.

Here are a series of problems you can solve, with some tweaks to the backtracking algorithm.

• Subsets
• Subsets II
• Permutations
• Permutations II
• Combinations
• Combination Sum II
• Combination Sum III
• Palindrome Partition