Problem Statement
Given an array of distinct integers candidates and a target value target, return all unique combinations where the chosen numbers sum to the target.
A number may be chosen unlimited times.
Brute Force Intuition
For every element, we have two choices:






