Given candidates: number[] and target, return every UNIQUE combination that sums to target. Each candidate used at most once. Duplicates in the input are allowed but must not produce duplicate output rows.

Notice: two 1s sit at different indices. They share a VALUE but not a POSITION. That difference is the whole problem.