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
Пікірлер: 721
@shrimatkapoor22003 жыл бұрын
I love when he says "once it hits you" like some kind of drug or something
@alienwareCL3 жыл бұрын
@Kayden Khalil Lol, that is scam! fake accounts
@nishantkumar11493 жыл бұрын
It's a better than a drug and the dopamine released on solving questions is sickkkk.
@JCatharsis2 жыл бұрын
It finally hit me I'm so high rn
@nikhileshkumar91262 жыл бұрын
don't do drugs bro. It's harmful.
@ncba2 жыл бұрын
Quite a common phrase
@dakshays63755 жыл бұрын
Damn !!! How did anyone come up with such an Algorithm
@nik2202874 жыл бұрын
Man the way you explained it in the first 5 minutes just clarified everything. Thanks. Great video!
@user-bv6bi2sz8r5 жыл бұрын
I was plagued by this problem for a very long time, you made it crystal clear, sir. Thank you!
@sshangrou87996 жыл бұрын
thanks very much.it took me long time to think the algorithm on leetcode, your explanation is so clear and concise.Very nice
@maxfeldman66546 жыл бұрын
probably one of the best explanations i have seen so far, SUBSCRIBED!
@beer_bandhu5 жыл бұрын
This is amazing. I was so confused by this problem, you explained it so succinctly. Thanks
@arthamsreenivas88585 жыл бұрын
Tushar Sir, you literally saved my time with crystal clear explanation on this problem.
@abhijeetpatnaik54942 жыл бұрын
I can't stress enough, how clear this video explanation is. Really loving your work, and it's very very helpful.
@soulmusic65303 жыл бұрын
after reading multiple explanations, this one finally made me understand how to think. Thanks for the video.
@sanjayizardar22634 жыл бұрын
Perfectly explained... Found most useful among all the available videos on KZfaq for median in two sorted arrays.
@user-vb2rm9hl9d5 жыл бұрын
this is the best explan I ve ever seen step by step with details, thank you
@marshallxu74804 жыл бұрын
this is the best video of all time, it brings happiness. thank you!
@balajim78014 жыл бұрын
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.
@eskuAdradit03 жыл бұрын
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?
@haoyuwu8942 жыл бұрын
@@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.
@DimpleSharma-jo9gf3 жыл бұрын
Such a great explanation! Love how you simplify things. Thanks a lot!!!
@rkalyankumar2 жыл бұрын
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!
@remixisthis5 жыл бұрын
Very well done detailed explanation. Much better than the LeetCode solution example. Thanks for taking the time to make this!
@yoosufahmadh39454 жыл бұрын
Repeat watching the first 6 minutes until you get it. Totally helps. Thank you so much. You simply put it
@zaheenrahman66086 жыл бұрын
My boy Tushar Roy! Earned yourself a sub! Gonna help my algo course so much
@dongshuowu34545 жыл бұрын
Thank you for the wonderful video. I was stuck for a long time until you made it co clear to me.
@35sherminator5 жыл бұрын
Legendary. Very crisp and clear approach. Thank you very very much!
@pawandeepchor896 жыл бұрын
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 !!
@bewareofnikhil Жыл бұрын
What a precise and correct explanation of the algorithm! Thanks for making and sharing this video, Tushar.
@JaySolanki915 жыл бұрын
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.
@anondoggo Жыл бұрын
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!
@saurabhzalke42323 жыл бұрын
So elegant and simple. One of the best tutorial ever! Keep it up.
@barmalini5 жыл бұрын
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
@kimmeng69395 жыл бұрын
7:18 end should be 5 not 4 because we are searching which position we want to cut.
@prakashtiwari78344 жыл бұрын
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.
@everydayleetcode29614 жыл бұрын
@@prakashtiwari7834 I was wondering why did he take end as 4 and read this comment ! Thanks a lot !
@emilyhuang27593 жыл бұрын
But why not 4? The 5th index is empty....so I would think the end is 4...?
@sharmamukul9383 жыл бұрын
@@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.
@varunwalia953 жыл бұрын
@@sharmamukul938 it should be the size of the array not index that is to be taken as high element according to code.
@hawaijarjs74963 жыл бұрын
Thanks Bro for the excellent explanation! It is crystal clear now how the logic works for both odd/even scenarios. Appreciate your time. Cheers!
@dzungdev4 жыл бұрын
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.
@meganlee58974 жыл бұрын
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
@gauravdudeja6 жыл бұрын
After watching 2 times it quite easy to understand. Keep up the good work Tushar.
@rogerwhite80615 жыл бұрын
Best explanation of this challenge I have found, thank you so much
@suvirsaurav55874 жыл бұрын
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.
@shaziasamreen85843 жыл бұрын
Even after 5 years your video is best for this problem.Thank you so much for wonderful Explaination
@MohitSinha44 жыл бұрын
Wow, your explanations are just great! Thank you so much!
@SonuSonu-tk5pk6 жыл бұрын
very neat and excellent explanation
@tusharroy25256 жыл бұрын
Thanks
@akshaysuman81686 жыл бұрын
Its so nice to see you back
@simingye75024 жыл бұрын
Best explanation I have ever seen! Thank you!
@SourabhCA4 жыл бұрын
Spent a lot of time trying to understand this from leetcode solutions and discussion. And you video explained it in 5 minutes
@Chandan-io3jm6 жыл бұрын
Best Channel for Data Structure && Algorithms !
@harishgovindan4 жыл бұрын
Excellent video! Quite precise and covers all aspects! Thank you!
@ADITYAKUMAR-yd3ow6 жыл бұрын
Perfect explanation, initially I though it would be difficult for me. But gradually you made me understand in only one go. Thanks 😀
@tusharroy25256 жыл бұрын
Great.
@vladn.23326 жыл бұрын
Very clear and good explanation. Thank you very much, Tushar!
@dragonflyboss71624 жыл бұрын
This explanation is so detailed, thank you!
@sanjitselvan5348 Жыл бұрын
I went through 5 videos before landing here and finally understanding the intuition behind the solution. Thank you!
@mccloud356 жыл бұрын
This explanation is fantastic. Great job Tushar!
@jessica_181111 ай бұрын
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.
@NeoMennon5 жыл бұрын
Tushar you are awesome! I have watched few video about this question, yours is the most intuitive one
@Priyankachauhan-qv2rx4 жыл бұрын
Hey Tushar, You make complicated problem look so simple and easy. Awesome job.
@video-vocabulary3 жыл бұрын
00:00 Introduction 01:39 Solution 06:19 Example 1 14:35 Example 2 20:11 Code
@abhinavgarg56113 жыл бұрын
Thanks buddy😊
@jaatharsh3 жыл бұрын
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.
@CodingWithPrakash_3 жыл бұрын
kzfaq.info/get/bejne/jZOFlM-rvrypmYU.html
@umairalvi73824 жыл бұрын
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
@lukaslehmann9708 Жыл бұрын
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.
@bharathik64794 жыл бұрын
Crystal clear explanation , Bro. You are helping a lot of people, Please Keep up the good Work.
@VishwajeetPandeyGV5 жыл бұрын
Thanks for this. You made it very clear & easy & fast to understand
@krishna09086 жыл бұрын
Excellent explanation, great clarity. Thanks Tushar.
@shwetankgupta5 жыл бұрын
Finally, I understood the crux of this problem. Thanks for the enlightenment.
@matthkang5 жыл бұрын
Thank you for making it clear and easy to understand!
@priyanka.sarkar5 жыл бұрын
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...:-)
@somiljain8966 күн бұрын
The best explaination with perfect testcases that I found for this question on Internet. Thank you!
@biswajeetchatterjee47215 жыл бұрын
Thanks Tushar.. Your videos really help to understand complex algos.. Keep it up and keep posting videos like this :)
@wengao654411 ай бұрын
This video is definitely the most effective one in providing a clear explanation of the algorithm
@shashankshekharkaushik15672 жыл бұрын
I was so confuse how to solve this without taking care of corner cases as extra, your explanation was awesome. Thanks
@vinayybhore6 жыл бұрын
Excellent Solution and the best so far explanation for this problem on youtube :)
@achyutaarjunneupane11546 жыл бұрын
great sir, got it in single explanation, I looked all over for over 4 hr
@tusharroy25256 жыл бұрын
+achyut aarjunneupane nice
@vishnup31824 жыл бұрын
Best explanation found so far. Thanks !
@Destiny223774 жыл бұрын
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
@vishwajeetpawar50742 жыл бұрын
Thanks Tushar.Your explanation helped a lot to understand the depth of logic and algorithm behind this question.
@jinny50253 жыл бұрын
wow there's nothing more than clearer than this! thanks :) you just saved my time
@double_courage573 жыл бұрын
@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!
@TheBuzoTechie2 жыл бұрын
thanks for the extra intuition :)
@return1210 Жыл бұрын
Thanks a lot!
@ahasunos59142 жыл бұрын
Thank you so much Tushar. This explanation will last for generations.
@alejandrofarias73205 жыл бұрын
Very good videos. You are great instructor. Cheers from México.
@techbarikcom4 жыл бұрын
You are making my life a lot easier! May God bless you
@nandanimadhukar3 жыл бұрын
Great explanation with ample examples! Keep up the good work
@stanleyakachukwu78812 жыл бұрын
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.
@juliahamilton34934 жыл бұрын
Thank you so much for explaining the algorithm! Very clear!
@DonchenkoNadia3 жыл бұрын
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
@gunahawk6893 Жыл бұрын
clean implementation good job
@jimz23925 жыл бұрын
Thank you Tushar, your video helps me a lot!
@pi3ni02 жыл бұрын
Thanks, good explanation. I was looking for different resources, but it was the best so far :)
@PhoenixRisingFromAshes4713 жыл бұрын
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
@vishnu_bhatt6 жыл бұрын
Helped a lot bro.Thank you for such good explanations.
@j50313j503134 жыл бұрын
You save my life. Just watch for 8 minutes and come up with a solution by myself!
@junjiechen73416 жыл бұрын
Very down to earth explaination.
@jayachandrann68256 жыл бұрын
Perfect explanation, thanks for your hard work !!!...
@nabidulalam69563 жыл бұрын
Simple and elegant explanation. Hats off.
@rapetiraviteja36784 жыл бұрын
elegant explanation! thank you Tushar :D
@user-pw1th5et9b2 жыл бұрын
Thank you so much. Your explanation is the best. Only with you I understood how to solve that problem.
@kumarann34835 жыл бұрын
clear explanation and concise code, good work!
@amirabdou49403 жыл бұрын
Excellent walkthrough of the algo and the code. kudos bro
@user-hr1tx7bo1w5 жыл бұрын
Thank you, it's very helpful.
@ehsona18274 жыл бұрын
the way the problem was broken down, amazing solution.
@igenyar3 жыл бұрын
Your explanation is so sharp clear. Thanks!
@DhananjayTyagi244 жыл бұрын
The best explanation so far.
@sindhusp89353 жыл бұрын
This is such a neat algo! thanks for the explanation
@kulkarnianiket9295 жыл бұрын
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].
@britisundarmondal72974 жыл бұрын
Thank you for the wonderful video. Easy explanation for such a complex problem.
@WS-lv4kk5 жыл бұрын
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.
@pavithranravichandiran6720 Жыл бұрын
Great observation!
@subhodeepganguly25754 жыл бұрын
Very Nice Explanation. One of the best videos of Tushar
@sharatchandra91983 жыл бұрын
Most Beautiful explanation and solution. My deepest gratitude to all your videos.