Tesla OA Question 2024 May | Two Pointers & Sorting | on-campus

Question: 3Sum Closest Problem Statement Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution. Constraints 3 <= nums.length <= 500 -1000 <= nums[i] <= 1000 -104 <= target <= 104 Examples Example 1: Input: nums = [-1,2,1,-4], target = 1 Output: 2 Explanation 1: The sum ...