BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition

[@abhik6400]

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 !!!

[@titusandronikus1337]

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

[@abhik6400]

@@titusandronikus1337 Really glad that you were able to come with the optimal solution on your own !!!!

[@priyanshurana6027]

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.

[@cosmicthor7330]

@@titusandronikus1337 same thought process is thinkable but seriously the implementation is though,hoestly i didnt understand fully

[@rajat5040]

@abhik6400 can u tell how it is doable from merge sort???

[@yatendraupadhyay2180]

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.

[@ravirajshelar250]

The going into recursion for swapping idea was 🔥

[@easylearn8924]

can you explain why he does that?? or we also use min(n1,n2) but it gives runtime error why??

[@tovenkatesh82]

@@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.

[@easylearn8924]

ok thanks@@tovenkatesh82

[@ashish4k07]

@@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.

[@easylearn8924]

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

[@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

[@mrlord8519]

​@@farazahmed7maybe from his sde sheet for placements

[@omkarshendge5438]

@@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.

[@prajaktachachad477]

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 :)

[@ruturajchandgude6083]

Watched both videos twice ,all 3 approaches are crystal clear now,thank you!

[@Dontpushyour_luck]

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-p2g4l]

Why we need to do that ? Can you explain

[@Beeplov2337568]

@@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)))

[@beast2811]

@@VivekKumar-p2g4l he is taking the first array to be smaller

[@mrsmurf911]

That swapping of the inputs and >>1 steps are 🔥 🔥

[@ashish4k07]

bit manupulation and swapping is to low so yeah it improves time mostly

[@Manas-jj6xf]

@@ashish4k07 Can you please explain why did he do bit manipulation there for find mid1? I've watched almost all his previous videos up until this problem, and he hasn't explained bit manipulation yet.

[@ashish4k07]

@@Manas-jj6xf basically >> means right shift which divides the number

[@harshit.53]

If i hadn't checked this video there is no way i would be able to think of this solution in interview Thanks...

[@harshhwardhanrai3716]

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. :)

[@shubhambagul3127]

Waiting for this one for a long time no one explained this problem this well , Thank you.

[@vartikasinghania9723]

at 1st I thought i wouldn't understand this, but it stick till the end and it was so clear. Amazing explanation and it so motivating to see the efforts made explaining this. Thanks a lot!!

[@SwatiSingh-ys6hm]

This is one of the bestest explanations I have come across. Totally cleared my concept. Thanks a lot sir !

[@RaginiGupta-q1v]

I don’t know whether you’ll read this comment or not, but believe me bhayia, I can’t imagine how I would have studied DSA without you to teach. Thank you so much, always. ♥

[@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.

[@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.

[@TusharKumar-u4p]

I am so dumb even after solving good number of questions on leetcode I even could not even think of like this.

[@ShubhamKumar-l2u2x]

same same

[@arpitgoyal2035]

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

[@Josuke217]

This is a great approach, no way I could come up with this in an interview...

[@Anshydv3]

The king of coding community 👑

[@shikhirkalia6828]

Best video explanation of this problem on the whole internet.

[@giteshkhanna2633]

One case that could have been discussed: That is: Can there be a case where, l1 > r2 & l2 > r1. What to do in that case? Answer: There cannot be such a case. This can be proved. So let's assume l1 > r2 & l2 > r1 & try to reach to a contradictory statement. So we know that r1 > l1 (Because array is sorted) Therefore, r2

[@apmotivationakashparmar722]

Understood completely . Great man , you are God in DSA.

[@yasaswinikarumuri9590]

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 !

[@linhnguyenduc641]

You deeply understand the problem and explain the solution well. Thanks.

[@ArpanChakraborty-do6yz]

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😇😇

[@arjunc1482]

bro..how will you use dutch national flag algo for this question?

[@ArpanChakraborty-do6yz]

@@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_asset]

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

[@aruna5869]

I shocked at the end of video after seeing the way you explained this complex optimal solution!!!! Thanks a lot!❤‍🔥💥❤💯

[@atulanand6428]

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.

[@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

[@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!

[@rahulseetharaman4525]

Crystal clear explanation. Explained your heart out. Thank you :)

[@ArunsinghParihar-j3j]

Mind Blowing Solution approach

[@dhananjayadhari6481]

Really wonderful approach and explanation

[@MrGohel-ni2py]

It is a Great question and explaination is just fantastic.

[@sibashis_12]

brilliant explanation. even hard topics seem easy when you explain them.

[@t3ch_r4id]

Thanku for making optimal vedio separately for this problem 🥲❣️🙌🏻

[@martinropke3390]

Very good explanation, thank you for this video.

[@pranavindore2410]

TOP notch explanation striver. I saw both videos. Understood completerly. Thank you.

[@pratulyapratap9329]

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 🔥🔥

[@ekanshsharma1309]

God Level Explaination sir 🔥

[@bgovindnaren7405]

thanks bro kya gajab video tha... smaj aa gaya...

[@shashankarora2945]

Explained so smoothly🔥🔥

[@playwithlinux]

Hats off to you Broh... THANKS A MILLION 💙💙💙

[@shshnk11]

Brilliantly explained!!

[@dxvya23]

Once again, your explanation is top-notch.

[@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 ❤

[@stith_pragya]

UNDERSTOOD..........Thank You So Much for this wonderful video................🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@angelinsnehav3354]

Thank you striver for the amazing content 🙇

[@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 💀☠"

[@successfoundation8872]

Woah bro that's deep😅

[@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!!

[@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.

[@jaypratap3888]

Thanks Bhai. Its a tough question, but explained it very nicely.

[@amitranjan6998]

Amazing, how you observe so minutely :) Bhai Hat's Off .

[@BhaweshKumawat]

17:55 l1 > r2

[@yygysgtyfugunvt]

This man is genius

[@umabharathis128]

Its very helpful and clearly understand...

[@ArnabBhadra02]

1 morning i would woke up and see striver had completed a2z series and i got my dream company.

[@MohitSharma-dy9ew]

Has the day come yet ?

[@rushidesai2836]

This was difficult to explain but great job Raj.

[@sagark4080]

@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?

[@takeUforward]

Yes because it means how many elements we take, either we can take 0 elements or we can take all which is n1

[@we_atheletes]

one of best video on yt

[@45vinitthakkar56]

hello

[@sumitkamble_]

At first the brain wasn't braining but got it at the end great explanation

[@GoodLuck-dv2zu]

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

[@VikasSharma-eg8mc]

Understood!! Amazing explanation

[@ashwingoel7173]

At 17:57 shouldn't it be l1 > r2?

[@rushidesai2836]

Same thing i was thinkking

[@nandini62]

Thank you so much broo for these series ☺️

[@welcometoc.s.easpirants]

Great explanation. Thank you ❤

[@kaichang8186]

understood, perfect solution

[@MAHALAKSHMIVEERARAJ]

Wow explanations. Big Thanks to Striver.

[@joeljacob4685]

Excellent explanation!!💌

[@maneeshkumarpatel9874]

Loved this approach❤

[@RohiniShankari]

love your lectures

[@ketanjain5390]

beautifully explained!

[@charuprabha9696]

This is a little bit too much for me to digest, but at least I understood most of it.🙂

[@RGUKTEDUIN]

Understood salute to striver🤓

[@nitishjaswal7564]

Thank you Striver sir 🥰

[@mahakasthurim4998]

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!

[@IamGroot455]

your explanation is awesome 😇😇. Finally i can rest in peace🙃

[@utkarshpawar8336]

@17.50 condition should be --- (l1 > r2) instead of (l1 > r1)

[@sachin_singh_tomar_]

I HAVE THINKED ABOUT THE (M+N)2 APPROACH BUT I THINK THIS APPROACH IS MORE FASTER

[@SHUBHAMSINGH-nv7ot]

17:52 l1 is greater than r2 (correction)

[@YogaJournalWithMimansa]

Amazing Explanation! Thanks!

[@animeshkumar2683]

Happy teachers day !!

[@ashishstark1741]

Iske expression dekhke hi flow bigad jata hai or iski english , his accent came from whole different dimension

[@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.

[@ShubhamKumar-uf3gc]

CLEAN AS ALWAYS

[@haripriya8034]

As mid1 = low + high >> 2 why we need to check mid1

[@empvaibhav9799]

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 💀)

[@arkadiptamojumder3800]

l1 should be greater than r2 right at 17:49 ?

[@faizanahmed9304]

Yup

[@abhinav7sinha]

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

[@jugnugupta6839]

Great explaination..Thank you.💯

[@Bigg_boss_trolls]

extordinary teaching bro

[@techatnyc7320]

Thanks Striver!!

[@souvikcseiitk]

this tutorial is awesome, thanks for this :)

[@DhananjayKumar-bd2jg]

why can't we take this case to eliminate right? if(l1 > r2 || l2 > r1) high = mid - 1;

[@sujeetiitd]

At [17:23], you're picking 4 elements from the "Top" (not "Left"). Slips of the tongue make the matter very difficult to follow.

[@rajnandinipatel81]

brilliant explanation

[@sauravsarkar4785]

great explanation buddy. Keep up the good work.