Given an array of distinct integers and a target number, return all unique combinations where the chosen numbers sum to the target. You may use the same number multiple times.
For example, if candidates and target , the answer is . Notice you can use twice.
This combines the combination-building pattern you just learned with a sum constraint. The twist: numbers can repeat.