can you explain why he does that?? or we also use min(n1,n2) but it gives runtime error why??
@tovenkatesh8210 ай бұрын
@@easylearn8924 the idea is to do a binary search over the smaller-size array. while loop is written based on that and that's why using min(n1,n2) would give you error.
@easylearn892410 ай бұрын
ok thanks@@tovenkatesh82
@ashish4k0710 ай бұрын
@@easylearn8924 If we do that that's also possible but the code complexity will be too large and the std. while loop of binary search won't work even I understood after that video.
@easylearn892410 ай бұрын
why it won't work in while loop can you explain?? because i able to understand but after sometime i confused in this part??@@ashish4k07
@abhik64006 ай бұрын
There is no way that you can come up with this optimal solution in an interview. Although the better solution using merge procedure from merge sort was pretty thinkable and doable but this is a completely genius solution !!!
@titusandronikus13375 ай бұрын
I came up with it on my own when solving it on Leetcode. Let’s be honest, the main idea is not very hard. But my problem was the actual implementation. You can see in the video just how many random +1 and -1 we need, as well as boundary checks. It’s crazy. I hoped Striver would find a way to make the code less ugly - sadly, no. The problem is just inherently very annoying
@abhik64005 ай бұрын
@@titusandronikus1337 Really glad that you were able to come with the optimal solution on your own !!!!
@priyanshurana60274 ай бұрын
I came up with different approach on this one when solving on my own. It's similar to what we do in matrix's binary search I guess ( I have not watched striver's videos on it). Basically searching for kth element in any sorted arrays. It took O( log(m*n)*log(max-min)) time complexity, pretty big but it's in log and was accepted in leetcode.
@cosmicthor73304 ай бұрын
@@titusandronikus1337 same thought process is thinkable but seriously the implementation is though,hoestly i didnt understand fully
@rajat50403 ай бұрын
@abhik6400 can u tell how it is doable from merge sort???
@sanketkumbhar8887 Жыл бұрын
He has already explained this in sde sheet but still he made a video for a2z sheet💯
@farazahmed7 Жыл бұрын
On which sheet has he explained this ? can you give me the link. Thanks
@mrlord851910 ай бұрын
@@farazahmed7maybe from his sde sheet for placements
@omkarshendge54383 ай бұрын
@@farazahmed7 i think he is talking about the placement series or the sde sheet of 180 questions he made long time ago, you should check that out.
@yatendraupadhyay21805 ай бұрын
Striver you are a real social reformer. At times when colleges are rendering students unemployable , you are making us industry ready. Dude Hats off to you.
@Dontpushyour_luck11 ай бұрын
best video of entire playlist. I never understood this problem's binary search approach earlier, but you solved it so well. And that idea to call that function again if sizeof(b)
@VivekKumar-p2g4l4 ай бұрын
Why we need to do that ? Can you explain
@Beeplov23375683 ай бұрын
@@VivekKumar-p2g4lIt might possible that the first array has greater size,so in order to take the shorter array to proceed he did it, hence TC : O(log(min(n1,n2)))
@ruturajchandgude6083 Жыл бұрын
Watched both videos twice ,all 3 approaches are crystal clear now,thank you!
@shubhambagul3127 Жыл бұрын
Waiting for this one for a long time no one explained this problem this well , Thank you.
@harshit.535 ай бұрын
If i hadn't checked this video there is no way i would be able to think of this solution in interview Thanks...
@mrsmurf91111 ай бұрын
That swapping of the inputs and >>1 steps are 🔥 🔥
@ashish4k0710 ай бұрын
bit manupulation and swapping is to low so yeah it improves time mostly
@harshhwardhanrai37163 ай бұрын
This is the first video that I have not understood of you. No matter how many times I watch I just can't understand. I'm just skipping this optimal approach for now. :)
@TusharKumar-u4p8 ай бұрын
I am so dumb even after solving good number of questions on leetcode I even could not even think of like this.
@ShubhamKumar-l2u2x2 ай бұрын
same same
@arpitgoyal20352 ай бұрын
you just have to understand all the concept better and try to practice more problems on your own and like solve some old problems as well to strength your concepts and get motivation.
@dp622Ай бұрын
these problems are standard problems aka basic ones, no one can come up with solutions of such problems unless they are god gifted in mathematics The problems in contest are variation of such basic problem which can be solved by all if they know basic problems.
@Vishal-s2g7cАй бұрын
bro you get better by uderstand
@prajaktachachad4777 ай бұрын
I wanna know, how you built your logic and how you became an expert in understanding this logic so well. I have been following your playlist for a couple of months and understood each problem so well. What steps do you follow in your initial stage to reach this point? Please help so that your valuable tips can help me crack coding interviews. Trust me you are simply Amazing and Genius :)
@SwatiSingh-ys6hm Жыл бұрын
This is one of the bestest explanations I have come across. Totally cleared my concept. Thanks a lot sir !
@avinashkumar3116Ай бұрын
If striver explains this question to a dead body and later asks him whether you understood or not. That dead body will yell from it's grave - "Understood Sir 💀☠"
@successfoundation887225 күн бұрын
Woah bro that's deep😅
@utsavseth6573 Жыл бұрын
Understood. GOod video striver. It's important to watch these important questions because it is not possible to invent these kind of solutions then and there itself.
@Dipanshutripathi2407 Жыл бұрын
After watching so many videos i actually the found the gem which resolved my all the doubts in such a nice and simple way.
@Anshydv3 Жыл бұрын
The king of coding community 👑
@shikhirkalia682810 ай бұрын
Best video explanation of this problem on the whole internet.
@stith_pragya7 ай бұрын
UNDERSTOOD..........Thank You So Much for this wonderful video................🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
@ashwingoel71737 ай бұрын
At 17:57 shouldn't it be l1 > r2?
@rushidesai28364 ай бұрын
Same thing i was thinkking
@aruna58693 ай бұрын
I shocked at the end of video after seeing the way you explained this complex optimal solution!!!! Thanks a lot!❤🔥💥❤💯
@ArpanChakraborty-do6yz7 ай бұрын
before watching this intution , my favourite intution was dutch national flag algo,,, but this question along with its explanation was beyond my imagination,,,, hats off to you.......and your expression after completing this ques shows how passionate you are about your work and this gives us too much motivation,,,thank you😇😇
@arjunc14827 ай бұрын
bro..how will you use dutch national flag algo for this question?
@ArpanChakraborty-do6yz7 ай бұрын
@@arjunc1482 I am not saying I will use duch algo here,,, I have just stated among all algo/intuitions duch algo and it's question was my fav,,, but after watching this question and it's soln , it is my fav now
@Health_asset3 ай бұрын
Thanks striver to explain this . I was thinking that this is too much difficult concept but after watching this video , I can do the similar stuff myself. Thank you so much
@apmotivationakashparmar722Ай бұрын
Understood completely . Great man , you are God in DSA.
@JeffreyConcerto Жыл бұрын
Such a thorough explanation! Exactly what I needed to help me understand this problem. Great energy throughout and the lesson was clearly well prepared and organized to educate and enlighten. Thank you!
@ArnabBhadra02 Жыл бұрын
1 morning i would woke up and see striver had completed a2z series and i got my dream company.
@sahilbani7020 Жыл бұрын
brilliant explanation, this problem is not only hard to do but also hard to explain
@abhicasm9237 Жыл бұрын
I did it using the approach of two sorted lists question and got 2ms solution. But this is better
@rahulseetharaman4525 Жыл бұрын
Crystal clear explanation. Explained your heart out. Thank you :)
@BhaweshKumawat8 ай бұрын
17:55 l1 > r2
@linhnguyenduc6416 ай бұрын
You deeply understand the problem and explain the solution well. Thanks.
@ArunsinghParihar-j3jАй бұрын
Mind Blowing Solution approach
@dhananjayadhari64817 ай бұрын
Really wonderful approach and explanation
@t3ch_r4idАй бұрын
Thanku for making optimal vedio separately for this problem 🥲❣️🙌🏻
@mano_003 Жыл бұрын
Thank u for doing things for us even in ur busy days...❤
@Sports590 Жыл бұрын
"Busy" are those People who disrespect others, People who respect are not Busy ❤
@Josuke2172 ай бұрын
This is a great approach, no way I could come up with this in an interview...
@yasaswinikarumuri95903 ай бұрын
I still can't imagine how would someone think of such an optimal solution? It's out of mind. Are we expected to think of such optimal soln? I'm asking this bcz, it took me lot of time to understand this soln even after a great explanation... Thank you striver for such a wonderful explanation !
@sibashis_1211 ай бұрын
brilliant explanation. even hard topics seem easy when you explain them.
@bgovindnaren74057 күн бұрын
thanks bro kya gajab video tha... smaj aa gaya...
@technicalworld6470 Жыл бұрын
What a energy ! Thank you striver for amazing content 🙇
@cinime Жыл бұрын
Understood! Super amazing explanation as always thank you very very much for your effort!!
@pranavindore241011 ай бұрын
TOP notch explanation striver. I saw both videos. Understood completerly. Thank you.
@sumitkamble_ Жыл бұрын
At first the brain wasn't braining but got it at the end great explanation
@sagark408011 ай бұрын
@takeUforward, @30.01 generally in Binary search of array we consider left =0 and right=array.size()-1 correct? But here why have you considered low =0 and high=n1 ( which is array size itself) not n1-1?
@takeUforward11 ай бұрын
Yes because it means how many elements we take, either we can take 0 elements or we can take all which is n1
@Donquixote-Rosinante9 ай бұрын
i tried to do it in zero-based. if e.g nums1=[1,3] nums2 = [2]. arr1Left = 2, arr1Right = inf, arr2Left = -inf, arr2Right = 1. arr1Left
@amitranjan6998 Жыл бұрын
Amazing, how you observe so minutely :) Bhai Hat's Off .
@dxvya23 Жыл бұрын
Once again, your explanation is top-notch.
@playwithlinux3 ай бұрын
Hats off to you Broh... THANKS A MILLION 💙💙💙
@shshnk11 Жыл бұрын
Brilliantly explained!!
@pratulyapratap93298 ай бұрын
Maybe it will help :) int mid2 = left - mid1; // left = how many elements i can pickup mid1 = how many i have picked up
@9-1939Ай бұрын
Best video. I watched twice and understood great effort and awesome solution 🔥🔥
@shashankarora29452 ай бұрын
Explained so smoothly🔥🔥
@javabytharun2 ай бұрын
awesome explanation
@mayanksankhla1538Ай бұрын
Great Explanation! Just one observation, while explaining solution you considered median to be r1/r2 value in case of odd total length, so left part doesn’t include median, but in coding part you have considered median to be l1/l2 which mean left part includes median. Got little confused with that.
@umabharathis12828 күн бұрын
Its very helpful and clearly understand...
@ketanjain5390Ай бұрын
beautifully explained!
@VikasSharma-eg8mc Жыл бұрын
Understood!! Amazing explanation
@charuprabha96963 ай бұрын
This is a little bit too much for me to digest, but at least I understood most of it.🙂
@jaypratap38885 ай бұрын
Thanks Bhai. Its a tough question, but explained it very nicely.
@atulanand64283 ай бұрын
I have also solved this but using another method: Approach was to iterate one smaller array from 1 to n and applying binary search and insert the element into another vector using bs.
@SHUBHAMSINGH-nv7ot6 ай бұрын
17:52 l1 is greater than r2 (correction)
@nitishjaswal7564 Жыл бұрын
Thank you Striver sir 🥰
@arkadiptamojumder3800 Жыл бұрын
l1 should be greater than r2 right at 17:49 ?
@faizanahmed930411 ай бұрын
Yup
@venkateshcharyakaram65476 күн бұрын
great explanation sir
@we_atheletes10 ай бұрын
one of best video on yt
@45vinitthakkar564 ай бұрын
hello
@mahakasthurim49982 ай бұрын
Hi bro . Recently i started to watch your array playlist. Today i watching this median problem . I clearly understood your logic at first time itself . I really amazed with your logical thinking . How could you come up with this logic . You are making me logical thinking and programming more interesting. I am started to learn all the concept . Now i am following logic which is already there. But the way you are approaching all the problem with different optimal solution, its very unpredictable. Please provide some tips how you have build your logic on each ptogram when you started your coding journey. That would help most of the freshers. Thank you!
@NaveenBeniwal-c7z2 ай бұрын
your explanation is awesome 😇😇. Finally i can rest in peace🙃
@GoodLuck-dv2zu6 ай бұрын
I think the time complexity is not the only reason why you should do a binary search on an array whose size is smaller. If you will do a binary search on the array with a bigger size, then you will not be able to construct the first array (left partition) to make two arrays asymmetrical
@techatnyc732021 күн бұрын
Thanks Striver!!
@RGUKTEDUIN8 ай бұрын
Understood salute to striver🤓
@joeljacob468511 ай бұрын
Excellent explanation!!💌
@animeshkumar2683Ай бұрын
Happy teachers day !!
@MohammadUmar-qn1sqАй бұрын
17:50 Its l1 > r2 :)
@nandini622 ай бұрын
Thank you so much broo for these series ☺️
@RohiniShankari2 ай бұрын
love your lectures
@MAHALAKSHMIVEERARAJ Жыл бұрын
Wow explanations. Big Thanks to Striver.
@maneeshkumarpatel98743 ай бұрын
Loved this approach❤
@nayankhuman10432 ай бұрын
Understood 😊. You d best ❤
@AkOp-bf9vm7 ай бұрын
why you taken 6 in limit , we have to take only five value???
@Ayush372627 ай бұрын
Same doubt, high = n1-1 kyu nhi hai?
@drishtirai8642 ай бұрын
Thank you, Sir ! :)
@DhananjayKumar-bd2jg8 ай бұрын
why can't we take this case to eliminate right? if(l1 > r2 || l2 > r1) high = mid - 1;
@abhinav7sinha8 ай бұрын
This is a very nice video and possibly one of the best explanations. I just have one suggestion - because you're teaching this online, if you could speak softly, I am sure people would appreciate it. Right now, it seems like you're shouting. I wish you the best, don't take this comment harshly
@nishaaa_maurya6 ай бұрын
Hi Striver, It was a great explanation. Thank you !! Can you please explain that, why are taking first vector is always smaller?
@welcometoc.s.easpirants6 ай бұрын
Great explanation. Thank you ❤
@anmolsaini2783Ай бұрын
Understood...🙌
@empvaibhav97994 ай бұрын
The idea clicked the moment he said how many elemts to pick from both the arrays. Started coding it and damn it was tough to code it (edge cases 💀)
@harshpatel6615Ай бұрын
Understood
@sujeetiitd2 ай бұрын
At [17:23], you're picking 4 elements from the "Top" (not "Left"). Slips of the tongue make the matter very difficult to follow.
@shashank_08074 ай бұрын
Khatarnak but bhot kuch seekha !
@snehachauhan2373 ай бұрын
it was superb................
@Farhankhan-im3dv6 ай бұрын
the man is not just king he is a ginius
@YogaJournalWithMimansa4 ай бұрын
Amazing Explanation! Thanks!
@souvikcseiitk2 ай бұрын
this tutorial is awesome, thanks for this :)
@shikher45593 ай бұрын
You are the best
@aryasharma69Ай бұрын
From A2Z sheet i must say I've watched every video and found the approach best but unfortunately i was not able to consider this as the easy/optimal approach as in previous questions approach striver used to deliver us.
@oyeesharmeАй бұрын
understood bhaiya
@NazeerBashaShaik5 ай бұрын
Understood, thank you.
@asmitraj4740 Жыл бұрын
Finally Understood man.
@utkarshpawar8336Ай бұрын
@17.50 condition should be --- (l1 > r2) instead of (l1 > r1)