combinationSum2 = function(candidates, target) {
    candidates.sort((a, b) => a - b)

    return dfs(candidates, target)
}
https://leetcode.com/problems/combination-sum-ii/
Time O(2^N) | Space O(N)
@param {number[]} candidates
@param {number} target
@return {number[][]}