Backtracking Problems

Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candi

Given an array of distinct integers nums and a target integer target, return the number of possible combinations that ad

Given an integer array nums and an integer k, return true if it is possible to divide this array into k non-empty subset

Given an integer array nums that may contain duplicates, return all possible subsets (the power set).