3 Sum Closest || Leetcode Daily Challenge || Code + Intuition + Example

16. 3Sum Closest
Medium
Given an array nums of n integers 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).
Link to challenge : leetcode.com/p...

[@farakahmd3134]

the catch that at the second condition we only have to assign sum = arr[i]+arr[j]+arr[k], without doing any k-- or j++ had me going.
Thank you so much :)

[@tusharnain6652]

Hey! how many problems have you solved on leetcode so far?

[@arshifatima5536]

You made this problem so easy to understand. Thanxxx!!

[@suryanshsingh3265]

Thankyou mam very nice and beautiful explanation can you please make video how to approch leetcode as begginer

[@sculptandstyle_]

U explain so nicely and concrete i jst love ur video please make more such video

[@HarishkumarVlogss]

//Same Explanation with different Solution
Arrays.sort(nums);
int n=nums.length;
int closeSum = nums[0]+ nums[1]+nums[n-1];

for(int i=0;i

[@yogeshyts]

why we are not skipping duplicate and calculating everytime for duplicate,we can use
// while (second < third and ar[second] == ar[second + 1]){
// second++;
// }
but this is not working Don't know why
please reply

[@saisharan1772]

We can use three pointers right for optimum solution

[@Mohit-te2jl]

Nice and simpler explanation!

[@webtechnology6439]

plg view full code after submitting and code typing time view max screen or possible to press f11 to full window.

[@anujrawat6304]

Great Explanation

[@jigarjoshi9198]

what if i store the elements one by one in new array of size three and by sorting them i can find the sum closest to target ?

[@anwarislive]

Is this the best time complexity we can get?

[@amansinghrana9435]

somw time u r best

[@adityakeshari2295]

Thanks for this nice explanation

[@sauravchandra10]

It would be much better if you could write a cleaner code, it is not just about getting the code submitted.

[@varshachainani2611]

why we done minus target

[@shivamnegi7552]

to fing the difference, or to find which is closest ..to find the distance

[@foodcourt6810]

why abs() is used? also why int start =num[i+1] rather than 0?please explain

[@avibirla9863]

abs is absolute value ...if diff is -ve it will consider in +ve only

[@nitinrai5053]

amazing explanation

[@stocks4Trading]

Thanks a lot maam :)

[@sculptandstyle_]

Please make video on suduko solver and valid sudoko 🙏🙏🙏🙏

[@probabilitycodingisfunis1]

Hey Shruti, thanks for asking, Sudoku solver video is already made:
th-cam.com/video/eLhmZlsGmvE/w-d-xo.html

[@rohitthakre215]

ye kitti osm hai yaar 🥰

[@rohitthakre215]

Tum n aise hi kisi ke bhi comment ko like mat karte jao,
Hame hope mil jati hai 🫣

[@Daman1628]

@@rohitthakre215 😂

[@animeshpandey2911]

thanks a lot

[@RajeshKumar._.16]

nice

[@techieworld4269]

why diff = INT_MAX ?

[@shivamnegi7552]

to find the minimum between two values , one should be bigger , but for the first element , there is no second valuw to compare , so we take maximum integer possible .

[@techieworld4269]

@@shivamnegi7552 thank you vro

[@shivamnegi7552]

@@techieworld4269 love you

[@avibirla9863]

Good explanation. But your intendations are pretty weird !!!

[@rishiSingh0898]

difficult to understand from this

[@siddhantgoyal5103]

what is this test case failing can someone help?
test case - [1,1,1,0] , target =-100
my code->
int diff=INT_MAX;
for(int i=0;i