3Sum (Leetcode 15) - Medium (Hindi) 

nice explained..

Great explanation.

nice explanation

Amazing explanation. For test case [-2,0,1,1,2] , the solution don't consider -2,1,1 combination as the duplicates are skipped but it is still valid. How it is handled as the solution is already accepted?

no need to check c duplicate because if b is not duplicate then list is unique.because any num is duplicate means list can have duplicates. it can save our time more

Well explained 👍👌

Helpful

✅ Useful Links 𝐈𝐧𝐬𝐭𝐚𝐠𝐫𝐚𝐦 - instagram.com/codingwithprakash/ 𝐖𝐡𝐚𝐭𝐬𝐀𝐩𝐩𝐂𝐡𝐚𝐧𝐧𝐞𝐥 - whatsapp.com/channel/0029VaACtTa4tRrpDCQc5f44 𝐋𝐢𝐧𝐤𝐞𝐝𝐢𝐧 - www.linkedin.com/in/prakash-shukla/

badiyaa video

is this the most optimized sol??

Just came on from your newly created website... Want to ask like you mentioned somewhere that you have privated some videos so the link u r going mention on the website is that now the crct way to approach the problem... I am saying this bcoz u told the previous problem were not having the correct way to approach

Nice video.The link to access the Free SSA course is broken.

is ur site having issue. while opening it is showing it is a mailware- go back

ek sawal: for dupblicate u are checking current index with next index , agar first index and some index in middle matches.

👌👌👌👌👌👌🙏

eroor aa rah hh sir apke wale code me

Where are your videos in which you explained Permutation (Backtracking problem)

Why you are not uploading any videos from past 1 month?

The actual example is nums = [-1,0,1,2,-1,-4], after sorting [-4, -1, -1, 0, 1, 2 ], why you are not taking this example.

where this code find ?

If a non-technical person visits your video and see in thumbnail 3sum i don't know what will he thinks 😂

Bro please reupload your backtracking videoes i didn't find any better explanation anywhere....humble request please!!!

List res = new ArrayList(); Arrays.sort(nums); for (int i = 0; i < nums.length - 2; i++) { if (i == 0 || nums[i] != nums[i - 1]) { int low = i + 1; int high = nums.length - 1; int target = -nums[i]; while (low < high) { if (nums[low] + nums[high] == target) { List list = new ArrayList(); list.add(nums[i]); list.add(nums[low]); list.add(nums[high]); res.add(list); while (low < high && nums[low] == nums[low + 1]) low++; while (low < high && nums[high] == nums[high - 1]) high--; low++; high--; } else if (nums[low] + nums[high] < target) { low++; } else { high--; } } } } return res;