Binary Search : Median of two sorted arrays of different sizes.
Vložit
- čas přidán 24. 07. 2024
- In example 1 end should be 5(not 4) since there are total 5 elements.
Find median of two sorted arrays of different sizes. Algorithm is based on binary search.
github.com/mission-peace/inte...
/ tusharroy25
I love when he says "once it hits you" like some kind of drug or something
@Kayden Khalil Lol, that is scam! fake accounts
It's a better than a drug and the dopamine released on solving questions is sickkkk.
It finally hit me I'm so high rn
don't do drugs bro. It's harmful.
Quite a common phrase
Damn !!! How did anyone come up with such an Algorithm
Man the way you explained it in the first 5 minutes just clarified everything. Thanks. Great video!
I was plagued by this problem for a very long time, you made it crystal clear, sir. Thank you!
thanks very much.it took me long time to think the algorithm on leetcode, your explanation is so clear and concise.Very nice
00:00 Introduction
01:39 Solution
06:19 Example 1
14:35 Example 2
20:11 Code
Thanks buddy😊
This is amazing. I was so confused by this problem, you explained it so succinctly. Thanks
In the first example, the end value at the start should be 5 as we can have a partition when all the 5 elements of array X will be on the left side.
I can't stress enough, how clear this video explanation is. Really loving your work, and it's very very helpful.
after reading multiple explanations, this one finally made me understand how to think.
Thanks for the video.
7:18 end should be 5 not 4 because we are searching which position we want to cut.
YES! Had the last element of first array been 10 instead of 15, the algorithm would've broken at 13:45. Anyways, the explanation was awesome.
@@prakashtiwari7834 I was wondering why did he take end as 4 and read this comment ! Thanks a lot !
But why not 4? The 5th index is empty....so I would think the end is 4...?
@@emilyhuang2759 Exactly even i'm not able to figure out why the end should be 5 and not 4 as it is clearly mentioned in the video that first array has 5 elements in total.
@@sharmamukul938 it should be the size of the array not index that is to be taken as high element according to code.
probably one of the best explanations i have seen so far, SUBSCRIBED!
Clear explanation. Thanks.
A small error, 8:33 value of "end" should be 5 (size of small array). I followed just your example and coded, everything was right but failing always, until I watched your code & realized that end should have initial value of smallest array's length.
any clear explanation on why would we do it like this? is it the same reasoning behind adding + 1 to the sum of both arrays before dividing by two?
@@eskuAdradit0 I think it's because in some cases we can have all the elements in x on the left side. He mentioned that partitionX is "the number of elements partitioned to the left in x." So in those cases, partitionX can be the size of the small array. Consider this example: arrayX: [1, 2, 3, 4] and arrayY: [5, 6, 7, 8]. All the elements in x are smaller than elements in y. Hope this helps.
Tushar Sir, you literally saved my time with crystal clear explanation on this problem.
Brilliant video and explanation!
One minor change to the 1st example:initialization:
1) pick smaller len
2) start = 0, end = len, binary search the len of left size of X
e.g with the first example:
1st round lo = 0, hi = 5, mid = lo + (hi - lo) / 2 = 2
2nd round lo = mid + 1 = 3, hi = 5
Repeat watching the first 6 minutes until you get it. Totally helps. Thank you so much. You simply put it
Perfectly explained... Found most useful among all the available videos on CZcams for median in two sorted arrays.
this is the best video of all time, it brings happiness. thank you!
this is the best explan I ve ever seen
step by step with details,
thank you
The best possible explanation of the problem I've seen so far. I have now clear idea on how median of two sorted array algorithm works using binary search & partitioning arrays. Good stuff!
Beautiful solution, thank you so much! I can't believe how close I was to the solution, I wished I pushed myself a bit harder, but this was a great educational experience. Thanks again!
I paused the video at 20:12 and now going to solve the problem at leetcode myself, thank you so much Tushar, your help for the rest of us who have never graduated from the CS but still want to become a sane programmer is invaluable
What a precise and correct explanation of the algorithm! Thanks for making and sharing this video, Tushar.
Very well done detailed explanation. Much better than the LeetCode solution example. Thanks for taking the time to make this!
Such a great explanation! Love how you simplify things. Thanks a lot!!!
Even after 5 years your video is best for this problem.Thank you so much for wonderful Explaination
I have seen many other videos for this problem, but yours is the one that made me follow every step clearly. Thank you!
Simply Amazing !!! This algorithm was really helpful and you gave good examples to solve it. Especially the one in which you covered the corner cases.
So elegant and simple. One of the best tutorial ever! Keep it up.
Thank you very much for your great explanation. I learn a lot from you, not only the code but the way to explain the problem.
Thank you for the wonderful video. I was stuck for a long time until you made it co clear to me.
Legendary. Very crisp and clear approach. Thank you very very much!
Perfect explanation, initially I though it would be difficult for me. But gradually you made me understand in only one go.
Thanks 😀
Great.
I went through 5 videos before landing here and finally understanding the intuition behind the solution. Thank you!
Thanks Bro for the excellent explanation! It is crystal clear now how the logic works for both odd/even scenarios. Appreciate your time. Cheers!
My boy Tushar Roy! Earned yourself a sub! Gonna help my algo course so much
@4:30 - I took a second to understand this : Think of the final sorted array (without duplicates) and draw a median line. We need to find the average of numbers which are immediately to the left and right of that median line. If x2 is immediately to the left of the median line, it has to be greater than y5 (remember final array is sorted). Similarly, if y6 is to the right of the median line it has to be lesser than x3. Hope this helps someone!
thanks for the extra intuition :)
Thanks a lot!
This video is definitely the most effective one in providing a clear explanation of the algorithm
The best explaination with perfect testcases that I found for this question on Internet.
Thank you!
Excellent !! Nothing more one can do to explain this problem :)
Thanks for sharing it buddy !!
You are a star, keep up the good work, cheers !!
Spent a lot of time trying to understand this from leetcode solutions and discussion. And you video explained it in 5 minutes
don't think there are words to express my gratitude towards your hard work in making such bloody awesome videos @TusharRoy
your videos indeed are class apart & blessing for someone who wants to gain in-depth knowledge on DSA.
czcams.com/video/W-UalzYVEiQ/video.html
Best explanation of this challenge I have found, thank you so much
Hi Sir, thanks for your great and detailed explanation...just had watched serveral videos and explanations before I saw your video...and finally I understood how it worked...It is really awsome that you used these examples to illustrate the problem (including the edge case) and in your code you also wrote so many annotations...I really appreciate your effort and great work.
Hey Tushar,
You make complicated problem look so simple and easy. Awesome job.
Excellent video! Quite precise and covers all aspects! Thank you!
After watching 2 times it quite easy to understand. Keep up the good work Tushar.
Thanks Tushar.Your explanation helped a lot to understand the depth of logic and algorithm behind this question.
This explanation is so detailed, thank you!
Very clear and good explanation. Thank you very much, Tushar!
Wow, your explanations are just great!
Thank you so much!
People like me wouldnt understand this video in one time,you gotta watch it multiple times ,read about the problem solving strategy then you will get the problem.
He has explained in a very good manner
I was so confuse how to solve this without taking care of corner cases as extra, your explanation was awesome. Thanks
Thank you so much Tushar. This explanation will last for generations.
Great solution. Not every detail was explained but as everyone else was saying this is probably the best solution on the net and if not it is one of the best ! The missing details can be inferred
Best explanation I have ever seen! Thank you!
very neat and excellent explanation
Thanks
Thanks for this. You made it very clear & easy & fast to understand
Best Channel for Data Structure && Algorithms !
Tushar, thank you so much! You explained it perfectly!
If someone need solution in Python, here it is:
class Solution:
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
if len(nums1) > len(nums2):
return self.findMedianSortedArrays(nums2, nums1);
x = len(nums1)
y = len(nums2)
low = 0
high = x
while low
clean implementation good job
came to "like" this video only found out that I have "liked" this video 4 years ago when I was looking for my last job. Thank you Tushar.
Its so nice to see you back
This explanation is fantastic. Great job Tushar!
Thank you for making it clear and easy to understand!
Excellent explanation, great clarity. Thanks Tushar.
Tushar you are awesome! I have watched few video about this question, yours is the most intuitive one
great sir, got it in single explanation, I looked all over for over 4 hr
+achyut aarjunneupane nice
Crystal clear explanation , Bro. You are helping a lot of people, Please Keep up the good Work.
Best explanation found so far. Thanks !
Thank you so much for explaining the algorithm! Very clear!
You are making my life a lot easier! May God bless you
Hats off sir...I am really overwhelmed by the way you explained this algorithm and made it so easy and simple...(y) Thank you so much...:-)
Finally, I understood the crux of this problem. Thanks for the enlightenment.
Very good videos. You are great instructor. Cheers from México.
Great explanation with ample examples! Keep up the good work
wow there's nothing more than clearer than this! thanks :) you just saved my time
7:21 What do you mean by +1 allows what to "play well with both odd and even number of elements in the combines array"?
So that we have extra element on the left side , where we are looking for median. listen from 9:59 ,it might help you.
Thanks Tushar.. Your videos really help to understand complex algos.. Keep it up and keep posting videos like this :)
Simple and elegant explanation. Hats off.
Your explanation is so sharp clear. Thanks!
Brother, you have done well in explaining this. Thanks! I wanted to abandon this until I saw your video. With what I have known now I can go and write it myself until I pass it without looking at random solutions across the internet. I have subscribed for more.
Thank you so much. Your explanation is the best. Only with you I understood how to solve that problem.
Very down to earth explaination.
Excellent Solution and the best so far explanation for this problem on youtube :)
Thank you for the wonderful video. Easy explanation for such a complex problem.
Perfect explanation, thanks for your hard work !!!...
Thanks, good explanation. I was looking for different resources, but it was the best so far :)
This is such a neat algo! thanks for the explanation
Excellent Break down. Much appreciated.
Thank you Tushar, your video helps me a lot!
Excellent walkthrough of the algo and the code. kudos bro
clear explanation and concise code, good work!
Thank you, it's very helpful.
For odd total array size, instead of adding 1 in the (x+y+1)/2 and taking the max of the left half, I think you can just do (x+y)/2 and take min of the right half.
Great observation!
15:24 If there are n element then we can partition that array in n+1 no. of ways.
E.G 4 elements then we partition it in.
1) 0 - 4
2) 1 - 3
3) 2 - 2
4) 3 - 1
5) 4 - 0
0-4 and 4-0 results in same arrays
Helped a lot bro.Thank you for such good explanations.
Great video! I think you need to divide by 2.0 on line 46. It failed when I ran it with input1 as [1,2] and input2 [3,4].
Jahapana tussi great .........sir i read a lot about this problem solution everywhere but finally came to understand from your video only...you made a very tricky concept so simple to understand
This was so wonderfully explained. Thankyou so much !!
The best explanation so far.