DIY: 3Sum Closest
Explore how to implement a solution for the 3Sum Closest problem, a key coding question asked in Amazon interviews. Learn to efficiently find the trio of numbers in an array that sum closest to a given target, sharpening your problem-solving skills for real interview scenarios.
We'll cover the following...
We'll cover the following...
Problem statement
You are given an integer array nums and an integer variable target as inputs. Your task is to find the three numbers in the given array that sum closest to the value target. You must return the sum of these three numbers.
Constraints
3 <= nums.length <= 1000-1000 <= nums[i] <= 1000- -