Please do give us a like and subscribe, it won't cost you anything, but it will motivate me to make such kind of content more and more.
@utsavseth6573
Жыл бұрын
Legendary stuff Raj bhai. Your explanation clearly shows you actually have a very strong depth on these fundamentals. And of course you do, you work for Google😉
@deepak8720
Жыл бұрын
Awesome stuff. Liked and subscribed. Keep going. 👍
@pardhi8959
Жыл бұрын
great content love u bhai
@pardhi8959
Жыл бұрын
I start by like for all the video
@Bhai9866
11 ай бұрын
Bhaiya code nhi chal raha hai 3 sum ki u give the condition sum is greater than 0 , less than 0 but didn't give the condition sum is equal to 0 why?
@luckshaeey
Жыл бұрын
Tried 2 sum, 3 sum and 4 sum problems together as a beginner. It was so frustrating after a point before I understood the optimal approach 😂
@rishav144
Жыл бұрын
true bro
@it-51gulshanbhati89
Жыл бұрын
u r strong bro u have tried all as a beginner 😅
@Akash-yr2if
Жыл бұрын
You have a lot more experience than the whole comment section combined.
@Ashutosh-t7j
Жыл бұрын
The optimal approach for 3sum is just the extension of optimal approach of 2 sum when the array given is sorted
@joeljacob4685
Жыл бұрын
@@Ashutosh-t7j yup !! you are right
@rajatyadav4077
3 ай бұрын
It's interesting-I initially tackled this problem with three nested loops, but when the time exceeded, I decided to find a way to eliminate one loop and ended up developing a two-pointer solution. Although I found the solution, I still enjoy watching Striver's videos to refresh my mind, spark creativity, and discover new approaches to problem-solving.
@karthikeyan.s2565
2 ай бұрын
Bro 3 loops was the best I could think of, I can't able to optimize it How do you develop this logical thinking ? Could you help me with this ?
@NeelakshiSachdeva
2 ай бұрын
Me too pls
@graviton001
Ай бұрын
I also solved with two pointer approach on my own after 3 loops got time exceeded 😊 he built my logical thinking
@rajatyadav4077
Ай бұрын
@@karthikeyan.s2565 This is a long process bro, keep in mind the techniques you have already employed and then try to come up with ideas for how we may shorten the loop as much as possible. Actually, after successfully answering an easy issue, I usually attempt to answer it in three or four ways (if at all feasible). Occasionally, after solving the problem, I peruse other people's answers on Leetcode to discover new strategies, and the Striker video assisted me in approaching the problem.
@shashankrajput8084
4 ай бұрын
That's what a explanation beginner require for these type of problems
Hi Raj, there are 2 slight mistakes in your optimal solution. 1: The for loop will run till n-2 instead of n, because when i=n-1, j becomes n (j=i+1=n-1+1) and num[j] throws out of bound exception. 2: We could also insert another check in the for loop(nums[i] = 1 there's no way any 3 elements sum would be 0 since the array is now sorted. 3: Here's the more readable code(JAVA): class Solution { public List threeSum(int[] nums) { int n = nums.length; List result = new ArrayList(); Arrays.sort(nums); for(int i=0; i low && nums[high] == nums[high+1]) high--; } else { result.add(Arrays.asList(nums[i], nums[low], nums[high])); low++; high--; while(low < high && nums[low] == nums[low-1]) low++; while(high > low && nums[high] == nums[high+1]) high--; } } } }
@devanshkhandelwal7749
22 күн бұрын
However, since j < k condition fails, the inner loop won't run, and thus, the loop safely terminates.
@Pamir026
Жыл бұрын
Yes! I was onto this optimal approach but my implementation failed because I wasn't thinking it through. Simply lovely explanation!
@itzmartin20
11 ай бұрын
Just cameback for a quick revision, and now it's indeed got into my head, thanks for your crystal clear intuition!
@pragyatripathi8833
Жыл бұрын
I love the way you teach bhayiya.❤❤ I don't have seen the teacher like you....you are God of DSA.
@abhijeetmishra3804
11 ай бұрын
how can one explain so smoothly man...Hats of STRIVER bhaiya
@subhranshuswayampravadash4656
Жыл бұрын
Thanks brother for helping and providing us amazing solutions of the most important questions that asked in MNC's. Thanks a lot brother🙏
@PrashantSingh-qr3vn
Жыл бұрын
Are u a genius how do u know what doubts a newbie would have . U r just superb in explaining the Algo
@swathigp3818
4 ай бұрын
Great examples, which helps understand the algorithm very clearly even for non CSE folks!!
@deepak8720
Жыл бұрын
Completely Understood your explanation! Thank you for what you are doing, and please continue the good work. You are an amazing teacher. Have watched 3 videos of yours and I was able to understand all 3 with out any confusions. Big thumbs up for the video. 👍
@AmartyaPardeshi
Жыл бұрын
My man is doing God's work, thanks for this amazing playlist!
@ruchikaahujaasm
5 ай бұрын
Explained all 3 approaches very clearly. Thank you so much!!!
@jeet-smokey
6 ай бұрын
We will never get such a detailed explanation of 3 Sum problem. You are a Legend for reason....Striver.....!!!!
@manvendrasingh4369
3 ай бұрын
While solving this problem, the very first approach which comes to my mind was optimal. Although the way I was handling duplicates was giving time limit exceeded error so I have to took help from gpt but rest of the logic was correct. Feeling extremely happy.
@sahulraj9536
6 ай бұрын
we can do a small improvement int the optimal code if nums[i]>0 then we can break the loop and return answer directly
@ru2979
Жыл бұрын
never got an opportunity to do 3sum 😢 koi na LC pe hi krleta hu 🙂 seh lenge
@AmanSingh-wr6mj
7 ай бұрын
agreed🤣
@shashankgsharma0901
Ай бұрын
we can keep the indexes of the elements in the hashmap as well, in one loop; then while taking i and j, we can check whether the index is same as that of i or j or not. That would require less time complexity than the better solution.
@sdakshin1
3 ай бұрын
I found your explanation the best among all available... gd job
@shubhamagarwal1434
Ай бұрын
#Free Education For All.. # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India.....
@ahssanakhtar5746
2 ай бұрын
Amazing content learn a lot every day from your course.Thanks for creating such an amazing course.
@cinime
Жыл бұрын
Understood! Super amazing explanation as always, thank you very much for your effort!!
@piyushroy3278
2 ай бұрын
Too good man, more and more kudos to you for such explanation. now im getting grip on building logic...finally.
@anuragprasad6116
7 ай бұрын
3-sum code using 2 for loops and 1 while loop. Using for loops helps in more readability in this problem. // Sort the vector and create ans array. sort(arr.begin(), arr.end()); vector ans; // Iterate the sorted array. for (int i = 0; i < n; i++) { // Make sure first element of triplet is unique. // Now whole array on right of 'i' is a 2-sum problem. if (i > 0 && arr[i] == arr[i-1]) continue; // Take -ith element as target. int twosum = -arr[i]; int right = n-1; // Look for unique 2nd element in the search space. Notice that for // each unique i, the pairs that create 3sum with it are unique. // Similarily, for each unique j, the 3rd element will be unique. for (int j = i+1; j < right; j++) { // Looking only for unique 2nd element. if (j > i+1 && arr[j] == arr[j-1]) continue; // Look for its partner. while (j < right && arr[j] + arr[right] > twosum) right--; // No need to skip. All the 2nd elements are unique! if (arr[j] + arr[right] == twosum && j != right) ans.push_back({arr[i], arr[j], arr[right]}); } } return ans; Similarily, 4sum can be broken down as: first unique element + 3sum in remaining search space.
@newbie8051
Ай бұрын
Was asked in Adobe interview for DEI hiring for specially abled candidates. Woah, thanks !
@TheDivyansh007
8 ай бұрын
When sum is less than 0 or greater than 0, then also we should skip for duplicates right? As sum will be same for the next duplicate value. EG: -4 -2 0 0 0 2 2 2. when i is at index 2, j is at index 3, and k is at the last index, and the sum is greater than 0, you want to skip duplicates for k as long as the value at k is the same as the previous one.
@codeman3828
Ай бұрын
God bless you for all the help you do
@lakshyarajsinghpanwar8523
Жыл бұрын
Java Solution that is accepted on Leetcode: public List threeSum(int[] nums) { int n = nums.length; HashSet set = new HashSet(); for (int i = 0; i < n - 2; i++) { HashSet s = new HashSet(); for (int j = i + 1; j < n; j++) { int third = -(nums[i] + nums[j]); if (s.contains(third)) { List temp = new ArrayList(); temp.add(nums[i]); temp.add(nums[j]); temp.add(third); Collections.sort(temp); set.add(temp); } s.add(nums[j]); } } List ans = new ArrayList(set); return ans; }
@mohitrawat8550
Жыл бұрын
Bro can please explain me new ArrayList(set); this line where u passed set how is this fetching List in hashset to arraylist of ans.
@rishav144
Жыл бұрын
God of DSA❤
@RahulKumar-zp1ln
Жыл бұрын
THANK YOU FOR EXPLANING IN SIMPLE WAY
@Manishgupta200
Жыл бұрын
Thanks for the in-depth explaination with in-depth time and space complexity
@UECAshutoshKumar
3 ай бұрын
Understood 👍
@placement123
8 ай бұрын
when implementing the second approach instead of using set, we can use unordered_map(with the second key as its index), and we will start i from 0 and j from i+1 and for the third value we can ensure by checking that the index of the last target element from the map should be greater than j :)
@lakshsinghania
4 ай бұрын
hey, im not able to digest this thing in the 2nd approach arr is -1 0 1 2 -1 4 and the i & j are pointing at -1 and -1 so arr[k] = -(-2) = 2 so for this we need to search in the entire array right and he stored [0 1 2] elements between -1 and -1 but what if the arr was like this 1 0 1 2 3 -4 and i is pointing to 1 and j pointing to 3 then arr[k] = -(4) = -4 then if we store [ 0 1 2 ] we will not find in the set as -4 is after the j pointer could u pls make me understand this as im bit confused
@CoDeEnthusiast-ev9zu
4 ай бұрын
@@lakshsinghaniayou are right but there is a catch here , When i is pointing to 1 and j is pointing to 3 we need to search for -4 in the hashset which is not available. However after that we will add the arr[j] into the hash set i.e. we will add the element 3 into hash set .. So in the next step j will point to 4 now we have to search for -(1-4) = 3 and this element 3 is present in the hashset thereby we will get the required unique triplet
@culeforever5408
11 ай бұрын
understood and came up with the optimal solution myself almost same. just used an extra set to store triplets 😅
@nikhilnarvariya397
Жыл бұрын
Noice title 😉
@takeUforward
Жыл бұрын
;)
@prajjwaldeepghosh7329
Жыл бұрын
Consdering the third solution cant we just use Set of List and return as List of List, then we avoid the two while loops : while(j
@sumanshekhar8110
Жыл бұрын
But it will increase your space complexity, those two while loops are light loops so Strivers 3rd solution I think is best as its saves space.
@RituSingh-ne1mk
9 ай бұрын
Understood!
@disciplines4
Жыл бұрын
nice all the three approaches, helped a lot.
@bopon4090
5 ай бұрын
Bro that hash map solution is so genius.
@user-st9ff2vh6l
9 ай бұрын
Understood
@secretvibz6300
8 ай бұрын
As Smooth as Butter 😃
@rishabhsingh-gw3gf
11 ай бұрын
2 sum , 3 sum , 4 sum...what is this Google...Name it GANGBANG...KATHAM TATA BYE BYE SEE YOU 😂😂😂
@AkshayP-x2t
Жыл бұрын
Hi, you are doing extremely good work DSA topics. You making concepts very clear. Glad that I got your channel reference. But un luckily I am from JavaScript background , i am finding a resources like anything for DSA, I dint get any . Your help will be appreciated on this.
@Bakwas_baate
3 ай бұрын
what a solution. MINDBLOWING!!!!
@satyapraneeth1078
11 ай бұрын
understood
@GhostVaibhav
6 ай бұрын
Understood🔥
@jingfulin2322
5 ай бұрын
Great job! your code is so clean.
@firebout7675
9 ай бұрын
understoood
@welcometoc.s.easpirants
9 ай бұрын
Awesome explaination. Thank u for such a great content.
@priyankaghosh2670
Жыл бұрын
best teacher in the world...........
@shrad6611
5 ай бұрын
If we directly use hashset and use pointer approach then we dont need to check many different conditions, which is easy for as a beginner class Solution { public List threeSum(int[] nums) { Arrays.sort(nums); HashSet res = new HashSet(); for (int i = 0; i < nums.length; i++) { int lo = i+1, hi = nums.length-1; while (lo < hi) { int sum = nums[i] + nums[lo] + nums[hi]; if (sum == 0) { res.add(Arrays.asList(nums[i], nums[lo], nums[hi])); lo++; hi--; } else if (sum < 0) lo++; else hi--; } } List resultList = new ArrayList(res); return resultList; } }
@Benstokes555
8 ай бұрын
mind blown, dopamine released, love u striver
@eashan2405
Жыл бұрын
Great explanation Striver ❤
@sarangkumarsingh7901
6 ай бұрын
Another Awesome Lecture................
@priyanshusinha68
5 ай бұрын
In the brute force approach discussed couldn't we have just sorted the array in the starting and then use 3 pointer technique instead of using sets
@moonlight-td8ed
Ай бұрын
dont forget to add if nums[i]>0: break at starting line in the for loop, since it is a sorted one, if your 1st element itself >0 then you cant find the sum that is ==0 so add this, which improves runtime drastically
@anmjubaer
9 ай бұрын
Great explanation but what about the time complexity of those 2 while loops from the optimal solution? Can you elaborate a bit here please?
@rahulraaja5056
Жыл бұрын
Great Explanation 💯💯
@MohammedAfzal-d2b
6 ай бұрын
what a fantastic explantion!!!!
@dipingrover1970
6 ай бұрын
amazing exlanation , loved this video
@_SahilShah
2 ай бұрын
Understood! I went somewhere near the optimal approach but wasnt able to come up with the concrete solution
@priyanshuagrawal7509
10 ай бұрын
Now i can finally answer someone if someone ask me have you done 3Sum 😆. Thanks Striver 😉
@VasanthChoudary-uc5cz
10 ай бұрын
13:07 we can actually use a hashmap, by sorting and storing all the elements of given array as key and indexes as values. If 3rd element of triplet i.e. -(arr[i]+arr[j]) lies in the map and you don't want it to clash with value at current 1st and 2nd elements then simple check if index of that 3rd triplet ele in map is greater than index of 2nd triplet j. Arrays.sort(arr);//o(n*logn) HashMap map = new HashMap(); for(int i=0;i > set = new LinkedHashSet(); for(int i=0;i > list = new ArrayList(set); return list;
@misty6129
10 ай бұрын
I have a doubt... Why are we running the i loop till less than n-2 and j till less than n-1
@VasanthChoudary-uc5cz
9 ай бұрын
@@misty6129 according to my intuition which I mentioned above , i always lies before j and k , j always lies before k.
@harshilpatel3205
Ай бұрын
Understood 🙏🏻
@arnd12940
Ай бұрын
in better solution ; time complexicity :-> O(n^2 * log(no. of unique triplets)) but for seraching to hashset using find and insert operation of hashset should we count ? why ?
@vishalgupta7522
Жыл бұрын
Line 29: Char 10: error: type 'vector' does not provide a call operator ans(st.begin(), st.end()); ^~~ 1 error generated. brute force code
@sayakghosh5104
Жыл бұрын
Awesome explanation....
@ruchirtd1
Жыл бұрын
Understood! Java Solution that is accepted on Leetcode: class Solution { public List threeSum(int[] nums) { Set res = new HashSet(); Arrays.sort(nums); for(int i=0;i
@joeljacob4685
Жыл бұрын
Beautiful dry run!! Understood😄
@Josuke217
2 ай бұрын
Dry run 🔥
@samlinus836
Жыл бұрын
Thank you bro, love from Tamil Nadu ❤
@Sumeet_100
5 ай бұрын
Thank you ❤
@sayantanpoddar5428
10 ай бұрын
understood!!! please came up with string series...please
@tanya8353
9 ай бұрын
Great Job again !!
@rohansingh6329
Жыл бұрын
awsm video striver ❤❤ the free education you are providing is helping a us alot.
@guneeshvats46
2 ай бұрын
Amazing explanation
@vineetjadhav1785
Ай бұрын
Gajab BHAI ❤❤❤❤❤❤
@pranabpaul6317
Жыл бұрын
Understood
@aviralmishra181
Жыл бұрын
I think it should work but it gives wrong answer on leetcode it does not passes all the testcases. If you find solution please comment back.
@pranabpaul6317
Жыл бұрын
@@aviralmishra181 class Solution { public: vector threeSum(vector& nums) { //first sort the array. sort(nums.begin(), nums.end()); int n = nums.size(); vector res; for(int i = 0; i < n-2; i++) { //to skip duplicate values in nums[i]. if(i == 0 || i > 0 && nums[i] != nums[i-1]) { int low = i + 1; int high = n - 1; int sum = 0 - nums[i]; //reminder a+b+c = 0, so b+c = -a; nums[low] = b //nums[high] = c so if b + c = -a (can be found that will be the triplet.) while(low < high) { if(nums[low] + nums[high] == sum) { //means triplet found. vector temp; temp.push_back(nums[low]); temp.push_back(nums[high]); temp.push_back(nums[i]); res.push_back(temp); //to ignore duplicate values. while(low < high && nums[low] == nums[low + 1]) low++; while(low < high && nums[high] == nums[high - 1]) high--; //[....1 1 0....] after above loop low is in first 1 so do low++ low++; high--; } else if(nums[low] + nums[high] < sum) { while(low < high && nums[low] == nums[low + 1]) low++; low++; //low++; } else { while(low < high && nums[high] == nums[high - 1]) high--; high--; //high--; } } } } return res; } }; This code passes all the test cases try it.
@rajumandal4156
6 күн бұрын
Understood❤
@konankikeerthi
3 ай бұрын
Understood bro. Thank you
@gamingchampions4105
11 ай бұрын
gained a subscriber with your amazing explanation
@NazeerBashaShaik
5 ай бұрын
Understood, thank you.
@hashcodez757
4 ай бұрын
Mza aagya Understood!!
@JackCoderr
Жыл бұрын
Thank you so much bhaiya....you are the best teacher ❤❤❤
@Prashant-Dedha
8 ай бұрын
its java solution even if i copy paste from your sheet is not working, only 3 or 4 test cases are getting passed for brute and better solution.😫😫😫😫
@hemantpatel1413
3 ай бұрын
Understood.
@VidhiJainB22CS083
3 ай бұрын
also, we can stop when nums[i] reaches some positive value in the most optimal solution, because after then zero cannot occur as our sum
@arunprashanna7494
Жыл бұрын
Perfect explanation
@user-xv7ms8bn2b
3 ай бұрын
best explaination !!!
@keerthivasan1734
9 ай бұрын
3 sum 🎉
@a1_32_aarushi8
Жыл бұрын
Thank you so much sir for such a nice explanation your are super sir❤
@souravmehraniya2832
Жыл бұрын
Keep going brother ❤
@S.Hirthick
2 ай бұрын
Understood sir thank you soo much sir
@DeadPoolx1712
Ай бұрын
UNDERSTOOD;
@AniketKumar-hf2bo
7 ай бұрын
understood ,thnx for explanation ❤❤❤❤❤❤👌👌💕💕💕💕
@redder02
Жыл бұрын
this would fail at -2,0,0,1,1,2 to avoid this in else section just change the position of j++,k-- in the end of the else section, because we are supposed to be at the uniqueth position
Пікірлер: 358