Given an integer array nums and an integer target, return the sum of three integers in nums whose value is closest to target.

You may assume that each input has exactly one solution.

Note: The solution is guaranteed to be unique.

Constraints:

• $3 \leq$ nums.length $\leq 500$

• $-1000 \leq$ nums[i] $\leq 1000$

• $-10^4 \leq$ target $\leq 10^4$

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.