Median of 2 Sorted Arrays of different sizes | Binary Search | Data Structures and Algorithms
Vložit
- čas přidán 28. 07. 2024
- 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐝𝐞𝐭𝐚𝐢𝐥𝐬 𝐚𝐧𝐝 𝐞𝐧𝐫𝐨𝐥𝐥 𝐟𝐨𝐫 𝐨𝐮𝐫 𝐋𝐈𝐕𝐄 𝐜𝐨𝐮𝐫𝐬𝐞𝐬 𝐡𝐞𝐫𝐞-
www.educosys.com
The video contains following parts-
0:00-1:00 - Question Introduction and example
1:00-3:00 - Brute Force approach with small optimization
3:00-8:15 - Logic behind need of partition
8:15-9:35 - Condition for correct partition
9:35-12:25 - Changing wrong partitions to correct one
12:25-15:53 - How to find partition - Binary Search
15:53-22:14 - Code
22:14-28:30 - Dry run for example
28:30-30:00 - Complexity
30:00-31:08 - Odd number of elements case
#dsa #softwaredeveloper #interviewquestions
Hi guys,
Should have covered one more point - you should apply binary search on the smaller array only otherwise you will end up getting error. I have covered the point of exchanging the arrays at around 29:30 but didn't exactly say that this is a must do otherwise will lead to error.
Thanks to so many of you who tried writing the code and pointed it out.
I left this point for the end coz I thought it would be confusing in the beginning but I should have put more emphasis on this.
Thank you and happy coding! ❤️
a=[100000]
b=[100001] i guess it won't work bcz
l1=-inf , r1= 100000
l2=100001 r2=+inf
so (l2
oh it is working my bad...... i was putting "hi=n-1" but as soon as I put "hi=n" it worked ... can't caught this annoying things in binary search...
Can you explain the reason for the error or the scenario where you get the error. In this video you do the binary search on the bigger array and it seems to work correctly, isn't it?
Mam can u explain why there is error when you run binary search on larger array ?
@@abhijithkashyap4537 because there is possibility that cut2 will go out of bounds if we take larger array for binary search.
avoiding this question from the past 3-4 months , and finally found this beautiful explanation .
Yaaaay 😇😇
@@KeertiPurswani how come you teach so simply these tough question 👍🙏 mam
DIDI ROCKS 🔥🔥
You are my bro😍
Achaaaaaaaaaaaaaaaa
Great Explanation!!
I watched 4-5 videos of the same problem but still found it hard to understand but she made it clear.
When I was about to exit the video, she said not to be worried as it is a hard one and stay till the end, so I stayed and I am glad.
Also, timestamps were a great add on, not many creators bother to put them.
One more thing, pls don't dislike(if you can't like) this video as it is almost half an hour long video, just imagine how much effort she must have put in this.
Thank you SO much Sarthak!! ❤️❤️ That is so sweet of you!
I am glad you stayed till end. While saying that stay till end I was wondering if I should say or not, but so glad that I said it 😇
Folks who are finding it difficult please watch multiple videos by different CZcamsrs and visit back again. Hard problem require different perspective and examples to understand properly.
Didn't understand the first 10 mins when I was watching this in the evening with a disrupted mind. Sat down at 6am the next morning with a calm mind and got everything! Great explanation! Keep up the good work!
Amazing Explanation!!
You always make sure that each and every aspect of the question is covered properly.
Thanks a lot!! :)
I could not find a better explanation than this on the whole internet, for this problem! Thank you, Keerti :)
Great explanation, In the starting I didn't understand much but till the end when you dry run the test case the solution is crystal clear by itself. Thank you for so patient and detailed explanation.
crisp and clear. Most importantly you are just addressing what a viewer might get struck at. Thank you so much
[2,3,4,5]
[1]
some modifications in the code...
*we need to keep n1< n2, if not pass the arrays in the function to make it n1
Thanks for this, added pinned comment 😊😇
Thanks bro
Very detailed and most clear explanation🔥 for this question on CZcams, Could you please make an explanation for the same question but array with same sizes 🙏
Thank you very much for this explanation! I'm sure I'll be going back over it once or twice before many interviews.
Hope you like other videos as well. Thank you ❤️
Amazing explanation. This really is quite tough question for a lot of people. You explained the solution with great ease and clarity. Looking forward to more such amazing content. Thanks.
I liked it a lot. You are really good at explaining the logic. It was like I was thinking along with you. Looking forward to watch more videos whenever I feel stuck at LC. Kudos to your efforts.
Thanks for explaining!
You make this question very simple.
Thanks Sunil. Glad you liked it 😊
Thanks for sharing your knowledge. One of simplest explanations I have seen. Keep up the good work 👏
This was literally the best explanation of this problem available on youtube.
Thanks Prashant. Means a lot 😇
I hope you like rest of my content as well 😊
12:39 Thank You so much, this was needed. This problem has an expert tag in gfg. I couldn't follow Tushar's explanation although it was my incompetence but finally I understood this. Thank you for your effort!
Glad you got it. Happy coding ❤️
Very detailed explanation and the diagrams actually helped visualize the solution!
HI Keerti, beautifully explained first the intuition and then the approach to write the code, starting with binary search and then optimizing. Please keep doing these amazing videos of hard problems. You rather communicate very clearly😀
Just wow! Nicely explained 👌🏻
Subscribed with All notifications turned on!👍🏻
Yaaaay ❤️❤️
Thanks!!
thanks for being so patient and reiterating imp points again.
Hope you like rest of the videos as well! 😇😇
I loved this solution, I loved how you labelled everything on the board. Made it so much easier to process. Thanks!
You are doing such a great job. It helps alot. Thanks for this amazing explanation :)
Thank you so much. Means a lot 😇😇
I was stuck with this problem since several days,finally understood the solution.Thanks for such an amazing and detailed explanation! :) ❤
So glad toy understood it ❤️❤️
Hope you like rest of the videos as well. Please do share the channel with your friends. It would mean a lot to me 😇😇
Great Explanation, Thank you so much!
So glad you liked it! 😇
thanks a ton for such a wonderful explanation of hard problems
This is hands down the best explanation to this problem....thank you.
Amazing Explanation!!
Thank you so much!
This video is very helpful.
Thank you. Hope you like rest of the videos as well 😇❤️
BEST EXPLANATION, REALLY IT IS AMAZING. EVEN FROM YOUR HARDWORK I GOT MOTIVATED .
Thank you SO much ❤️❤️ means a lot 😇😇
finally i get to understand this algo.
really great explanation ,this video deserves more views.
Thanks Lokesh. Please do share the channel with your friends and help it get better reach 😇
Hope you like rest of the videos as well. Keep sharing your feedback!
brilliant solution and very helpful explanation! thank you for doing this video
The best video on this specific problem, subbed!
I just like how you explain things with so much calmness. Kudos Keerti!
You have explained very well Ma'am. Please upload more videos of data structures and algorithms. And thanks for explaining this problem in a simple way.
Many videos coming up Naman. Thank you 😇
Procrastinating the problem for so long, but not anymore. Just crystal clear 🙏
Yaaay ✌️✌️😇😇
Excellent Explanation!! Thank you!
thank you, your explanation is the best. it was rlly good when you applied the test case
Terrific Explanation, Ma'am. Crystal Clear!!!!
Thank you so much ❤️😇
You can make as good as a teacher as you do as a software engineer!!
You have the flair for teaching!!
Very good!
Loved the explanation !! Thankyou so much. :)
Thanks Versha! Hope you like rest of the videos as well 😇
Thank you so much for explaining it .It helped me a lot .Really appreciate your efforts.
Thank you Sameeksha. Hope you like rest of the videos as well ❤️😇
very well Explained....It's really Amazing !
Hi Keerti ! I have recently started seeing your videos, for this one specially I must say you have just done an awesome job.
seriously escaping from that question from past 2-3 months 'coz the explanations avail were very confusing . thank you so much for explaining with such a great precision.
Thanks for the such a nice explanation, really helpful.
Thankyou so much. I was stuck at this problem for weeks.
WoW!
All i can see is 5-6 hrs (even more than that) of hard work just to make us students understand a complex and hard solution in 30 minutes.
It was fantastic ! Loved your in-depth explanation and analysis.
Thank you so much, and honestly it's much more than 5-6 hours 😅😅
Hope you like rest of the videos as well!! 😇😇
@@KeertiPurswani how long did it take you to solve this problems completely? is it reauired to he gennady level in software dev or not?
Thank you so much for the explanation! I was stuck thinking how can I reduce O(n1 + n2) to O(log(min(n1,n2))) for so long!
Such a awesome and cleared explanation . Thank you so much ma'm.
Thanks Divesh. Glad you liked it 😇
Thank you!!! Good Explanation!!!
Really the best Effort.Thank you so much for this
Thank you! Hope you subscribed 🤭
Hello @keerti Purswani, atlast why we have to consider the smaller length. Because i ran the same code with the greater length ,its not working . Could you please me tell why. Thank in advance !
Great Explanation!!
You made it so simple. Thank You!
Thank you Sakshi. Means a lot ❤️😇
becomes clearer and clearer slowly, thanks
thank you !! great explanation
Thanks mam I was trying to understand this ques from many months. Now I've understood properly.
Great explanation ☺️☺️☺️
Very beautifully explained !! No doubts now .. Kudos
Yaaay 😇😇
Keerti Di, thank you so much, for such a great and easy explanation for such a difficult question. You have really helped a lot. Thanks a lot 🙂
Thank you so much Shikhar. Means a lot to me❤️😇
Please do share the channel with your friends. It will really help me be more motivated and create more😊😊
Easy and helpful ! Thanks
Thank you so much for the video ma'am! I remember requesting this video a while ago, I'm glad you accepted this question :)
Hope you liked the explanation!
Trying to cover all the requested questions 😊
@@KeertiPurswani cses.fi/problemset/task/2216 ... please solve this problem it's solution is not available on internet
@@brickcommander I've added comments to my solution (pastebin.com/UtbFiUkY ) for the question, I hope it helps.
@@royarijit998 thankyou sir, you saved me
I just saw these comments! SO SO happy to see people helping each other out. Thank you Arjit. Super proud of you ✌️✌️
Absolutely amazing explanation.
The best explanation in the entire youtube.....Thanks.
Best Explanation of all the recommended videos✌👍
Thank you so much. Hope you like rest of the videos on the channel as well ❤️😇
Thank you so much for the video!
Thank you for the comment and for the support 😇❤️
A very good explanation. Thank you.
excellent explanation :) best explanation available in YT :) Thank u :)
dry run clear all the intuition behind that stuff good job
You have explained with so much patience...kudos to that..i will need to re-watch once again to understand fully...here's to understanding better ... cheers
Thank you. Hope you understood everything!! 😇😇
One of the best explanations I got online. Thank you.
Thanks a lot for the great Explanation! May I know why hi has to be set to the length of the array? instead, I used to set hi = len(arr) - 1 in a Binary Search. So could you please explain this point as well?
amazing explanation ma'am !!! one wouldn't find a better one
Amazing explanation, dry run helped a lot
Thank you! Hope you like rest of the videos as well 😇😇
I watched 3 different videos for the same problem.
This is the best crystal clear explanation. Kudos to you. Here is the Java code I have written.
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
if (nums1.length > nums2.length) return findMedianSortedArrays(nums2, nums1);
int m = nums1.length, n = nums2.length;
int low = 0, high = m;
while (low r2) {
high = mid1 - 1;
} else if (l2 > r1) {
low = mid1 + 1;
} else {
return (m + n) % 2 == 0 ? (Math.max(l1, l2) + Math.min(r1, r2)) / 2.0 : Math.min(r1, r2);
}
}
return -1;
}
i almost did the code but i have taken hi=n-1 and did something like that
but how did you figure it out that we have to use h1=n ?
Notes for myself:
Concept:
Find approximate positions where the two lists are grouped into left and right
such that max(left)
Finally understood the whole solution & intuition.
Thanks a lot for clear & detailed explanation.👌
So glad it helped! Hope you like rest of the videos as well 😇😇
@@KeertiPurswani Of Course Mam .
Even I have sent you connection request on LinkedIn.
Awersome explanation...seen multiple videos but this was the best
Yaaaay. Thank you❤️❤️
Please do share the channel with your friends 😇😇
Hi keerthi.Fantastic teaching.ill try out the code today with even and odd sized arrays.Can i use the same approach to find out median of 3 sorted arrays?
Very well explained Keerti Di.Thanks for making video on this .I have gone through lot of articles and videos. Finally got clarity after watching this wonderfull video. Thanks a lot.The way you are helping us is really appreciable. Wish you to stay healthy and keep posting such videos.
Thank you so much Ranbir. It really means a lot 😇😇🙏🏻🙏🏻
Amazing explanation !
Thank you so much for such a beautiful explanation
Finally I realized why we are doing what we are doing.
the best explanation of all the videos on the same problem.
Great. Thanks for giving nice lesson
Amazing video Keerti. Really appreciate. Very well explained.
I have seen so many confusing videos of the same problem, but you explained it really well. Thanks
Best explanation on the internet..more power to you👌
Thank you so much. Please do consider sharing the channel with your friends 😇
You got awesome teaching capabilities. This explanation was truly in-depth and very helpful. Thanks a ton, Keerti. Please do keep teaching on this channel, even after you clear fb/google etc :)
P.S another good candidate for Binary Search: Split array largest sum
That one is on my list already 😊😊
Thanks for the support! 😇
this is very great explaination... thank yo so much
very nice explanation
Thank you so much for this video
Glad you liked it 😇
Such a great explanation! Thanks a lot Keerti!
Thank you Shivani. Hope you like rest of the videos as well 😇❤️
@@KeertiPurswani you're amazing Keerti! Believe me, the questions for which I have watched your explanation, all those questions explanation is pasted in my mind. I can never forget the explanation. One day, I was solving find the running median question in some interview, and I your entire video was playing in my mind during the interview! Keep up the good work! You inspire me! :)
That's so nice of you Shivani. Your comment made my day. Thank you ❤️
Very good explanation I was no able to understand after watching too many video.Now everything is crystal clear
So glad to know 😇❤️
This is the best explanation for this problem. understood it.
I never understood this, and median of the stream questions before your explanation video keerti ma'am. Thank You and Please make more videos on such hard problems.
So many videos coming up! 😇😇
Can you explain the reason for the error or the scenario where you get the error. In this video you do the binary search on the bigger array and it seems to work correctly, isn't it?
Could you please share me the code link ? I am getting few execptions while running the code
thank you so much!! extremely well explained
It is the easiest explanation in whole CZcams, u teach important thing "we need why to understand how".
really well explained. thanks :)