Freaks City

Given an array of integers candidates and a target value target, find all unique combinations in candidates where the numbers sum to target. Key constraints: Each number can only be used once in each combination. All numbers (including the target) are positive integers. The result set must not contain duplicate combinations. Examples Example ...