DIY: 3Sum Closest
Explore how to solve the 3Sum Closest problem by finding three integers in an array that sum closest to a target value. Understand the problem constraints, develop a Python function, and improve your ability to handle common interview questions encountered in Amazon coding interviews.
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- -