Java

LeetCode Problem-16 3Sum Closest [Medium] (Java)

Welcome to the 16th coding challenge of leetcode problem series. My aim to provide more than just solutions. In each leetcode problem, expect a comprehensive breakdown of the code, a deep dive into the techniques employed, and a thoughtful exploration of why we opted for a specific approach. Join me as I embark on this journey of problem-solving, where each challenge serves as a stepping stone to honing our coding skills and making informed algorithmic choices. Welcome to a series that not only solves problems but also demystifies the thought processes behind effective coding solutions.

LeetCode Problem-16 3Sum Closest

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.

Example 1:

Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

Example 2:

Input: nums = [0,0,0], target = 1
Output: 0
Explanation: The sum that is closest to the target is 0. (0 + 0 + 0 = 0).