Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order. The same number can be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.
You are given a collection of distinct candidate numbers and a target number. Your task is to find all unique combinations of the candidate numbers that sum up to the target. Each number in the candidates list may only be used once in each combination. The solution should exclude duplicate combinations.