Given an integer array candidates and an integer target, return all unique combinations of values from candidates whose sum is exactly target.

Each value in candidates may be selected at most once in a combination. The returned list must not contain duplicate combinations, even if candidates contains repeated values.

Note: The order of values inside a combination does not matter, and the order of combinations in the output does not matter.

Constraints:

• $1 \leq$ candidates.length $\leq 100$

• $1 \leq$ candidates[i] $\leq 50$

• $1 \leq$ target $\leq 30$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.