BS-27. Median in a Row Wise Sorted Matrix
Вставка
- Опубліковано 11 вер 2023
- Problem Link:
Notes/C++/Java/Python codes:
We have solved the problem, and we have gone from brute force and ended with the most optimal solution. Every approach's code has been written in the video itself. Also, we have covered the algorithm with intuition.
Full Course: bit.ly/tufA2ZYt
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
0:00 Introduction of Course
In era of every other YT FANG employers leaving their job and selling own courses, Striver is the only legend who's not giving up❤️ and managing both🙌.
tereko uske job chodne ya na chodne se kya farak pdta hai
Thank you so much for your wonderful videos, Plz keep them coming 🙏
Your one line always keep me running positively, "Life bohot badi hai, dont give up easily, try try try again" .Thanks
okay i have a doubt the mid that u calclated which is 7 is based on the above matrix but the below sorted array has 16 elements. this sort made of made the whole explanation confusing
if anyone is reading this do u agree or did i miss something
15 element hi hai dhyan se gin
Finally completed the playlist. Thank you striver !
Finally completed Binary search playlist. This series is Amazing!!! In depth explanations, diverse problems, and great logic building!👏👏👏
Aatma santusht ho gaya Striver bhaiya ye lecture dekh kar maaza ageya , Big thanks Bhaiya , love you, you are an inspiration for me !!!!!!!!!!!!!!!!
with this i think my intuition became better for using BS in various types of questions
Thanks RAJ sir
New video means more knowledge. This consistency is amazing.Understood
And Yes Reverse Polarity is also working here as
*High pointing to an element that is greater than all the elements* and *Low pointing to the smallest element*
If you dry run then low end up pointing to the answer.
Thankyou soo much Striver..... I'm just soo damn grateful to you 🙇♂️
yes, I am from python community didn't find any issue in the course. I think this course is one of the best course. I have taken purchased course also but this is one of the best course.
Eagerly waiting for Strings and LINKED LISTS😢
agle saal aeega wo wala playlist
@@cdnggk6455 really or kidding?
why?@@cdnggk6455
Strings me kya pdna h? vo toh question practice krte-krte hi aayega.
@@zanies6288Improving problem solving of Strings in a brute, better, optimal is much necessary for beginners of DSA.. I would like to remind that it's A TO Z BEGINNER COURSE...🙂
Completed the playlist..! As usual.. OP Striver.. Keep rocking man... Eagerly waiting for your more playlists
best playlist. Understood everything!
I really like your way of teaching
Keep uploading!!!
Striver u are really doing a good job and helping thousands of aspiring engineers like me ❤️❤️❤️❤️, please can you add low level design playlist .. like OOP design interviews in c++
please keep uploading bhaiya this series at least 1 video a day.. ThankYOu ❤
Previously Studied Binary Search 9 months ago , now again done a broad revision from you , now concepts are more crystal and clear than before . Thanks Striver for your continuous effort to reform the IT Industry in India by teaching the new generations topmost Coding skills . God bless you . Will now revise both Graph and DP from you shortly . 😊💌❤
understood! and finally completed this binary search playlist. Did learn a lot!!! Thanks Striver....
Please try to upload a video daily Placements already started and yours videos are really helpful
Hey Striver, Thanks for the wonderful videos... I am unable to grasp the concept, maybe because its 4:50am and I have exhausted my daily quota of brain usage... Haha, will try this one later...❤
thanks for the wonderful series..
Eagerly waiting for strings❤❤
Doubt - what makes it sure that the answer will be present in the matrix? Like how can we say the answer we found will always be in the matrix?
Even I have the same doubt. Lemme know if you get that.
++ Is there some kind of proof for the same? Please let me know once you get it.
@@aletivardhan6679
@palakkalsi8595
@Ajay-cv1zs , striver has replied on this issue on one of the comment, let me paste here, "this is why we keep moving low and high, and we don't stop. Its bound to stop at a number which is answer. Because if the numbers are [1,5, 6, 7, 11]
It can never stop at 9 because 8,9,10 all of them will have same number of elements on left."
See if some element in not present and it has
completed BIinary Search playlist on 12/05/24... Explanation and Content was awesome ....
Its crazy I am unable to solve the problem on my own until I watch the logic. I hope I improve this.
Thank You So Much for this wonderful video..............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
Happy to share that i was able to solve brute but couldnt do the optimal
Understood!!! Please make a playlist of strings as well,Thankyou.
understood man.. Completed this playlist also, Great teacherr🤩
Loved it ❤
Bhaiya can you make next playlist on *greedy algorithms*. No one in youtube is having a proper videos on it.
Understood, thank you.
Brother you are god for me 💖
Thanks a lot striver , I was able to crack amazon interview through your series.
Very nice explanation
you are my role model
Striver please upload videos on strings and linked list of A2Z dsa course i am eagerly waiting PLEASE
Sir ,
Is it okay if the median answer that we are returning is not in the matrix . Because in some cases mid value (average of high & low) may be not present in the matrix , but numbers " lessequal " than this value are more than "req" , which satisfies the condition so it will be returned.
have you got your issue resolved yet or not
because I'm thinking the same thing for half hour
I also thought the same.
Sorry, watched the video couple of times but didn'y understood the thought process, can you help please....
Damn this guy is top notch!
nice explanation 👍
Thank you 🙂
PLEASE BRING STRINGS PLAYLIST SOON !!!!!
sir can you tell when are you going to upload the next videos as we are waiting from 1 month now?
Understood✅🔥🔥
Thank you Bhaiya
Thalaivar. Striver ka hukum.
aranthamaintharaja
Mission Accomplished sir ji
when will you upload String videos?
Understood🙃
Bhaiya ❤
bro plz upload strings and linked list
Understood!!
Striver start sliding windows and greedy atleast provide a basics video😢 i solved the linked list fully now it was good but greedy and sliding windows looks like something big can you give a start
Could you please tell me which tool you uses for teaching ?
Which app do you use sir for notes?😊
bhai strings ki playlist laado ! will be of great help!!!
Thanks
Understood
we can assign low = matrix[0][0] and high = matrix[n-1][m-1]
New question from binary search
If you observe then after the first solution that was *n* * *m* *** *(n* *** *m* *** *log2(nm))*
Instead of removing the -log(nm)-
We can Optimize that instead of putting all the elements in an array we can sort the 2D Matrix itself and use the formula of total_column / index
And this will work because the rows and cols will be odd everytime
So the TC will be *(n* *** *m* *** *log2(nm))*
The TC originally is n*m*log(2nm) because , you will use O(n*m) to traverse all elements in the 2d array, and then you will sort the n*m elements using inbuilt function, so TC will be O(n*m + n*m*log(2nm))
can anyone tell me, what software he is using for sketching in this video
brother there is no 6 in that matrix from where are you taking this 6 that you have written in the 1D array
understood
Striver, here the code looks all great but how are we navigating the matrix here, I am very confused regarding that, the code is navigating as we have used an array, with all the number. But it is very different scenario in the matrix.
Also the final answer/code for this problem isn't available in the description. Can you please look into it?
Just wow
Bhaiya linked list aur string ki bhi videos aane wali hai kya? If yes then what will be the timeline so that usse ki hisab se preparation ki planning krte
bhai striver ne poori complete karwa diya hai kya dsa playlist? aur kya videos sequence mein hain?
tumko kitna fayda hua?
kitna padhe?
@@ultimatescience3842pura complete nhi hua hai........sequence mat Haan jaisa a-z DSA playlist me hai waise padhna start Karo bahut faida hoga......Maine personally padha hai islia bata sakta hu
understood.
Will this work if array is sorted Ina way that last index of first row is less than first index of second row and so on
Yes, in that case last index of second row should be the largest value
Eg [[1,2,3],[4,4,4]]
What if the input arr is [[1,2,3],[1,2,3],[1,2,3]] . then (n * m) /2 will not hold. Can someone please clarify ?
How can we be sure low+mid/2 belongs to the matrix
this is why we keep moving low and high, and we don't stop. Its bound to stop at a number which is answer. Because if the numbers are [1,5, 6, 7, 11]
It can never stop at 9 because 8,9,10 all of them will have same number of elements on left.
@@takeUforward What if array is [[1,2,3],[1,2,3],[1,2,3]] . In that case how will the req = (n*m)/2 will hold ?
Please make playlist on strings
sir
Striver I'm a final year student,now campus placements are going on so can you please tell when this course may finish...
If you are final year student, don't waste on this course. This is for beginners and people who have a lot of time. Just read the articles on takeuforward solve some problems on leetcoee u will learn more in less time.
Can you please teach us maths required for competitive programming.
does anyone know, which companies have asked this question?
Hey Striver, I have one doubt will you replace all the old videos(DP series, Binary Search Trees, Graphs and other videos) with new videos or will you continue with the old one, so that we can wait for new one or we can continue can you please give some clarification on this.
By the way you videos are really helpful. Thanks for such free content.🙏
No those videos are (Trees, DP and Graph) pretty new. And bhaiyaa will not be replacing those videos.
@@bishalkundu7592 is hsi playlist completely updated and complete? Are all the videos arranged in serial?
@@ultimatescience3842 what do u mean by hsi playlist?
@@bishalkundu7592 sorry bro, I meant "His". Matlab poora complete hai dsa? aur agar playlist ko follow karein A to Z toh kya saare videos serial mein hain?
Plus mai ekdom new hoon programming mein, abhi third year start hua. Mai c++ soch raha seekhne ko toh wo kaha se seekhun? c++ with dsa karne ki soch raha hoon. Please bro thoda detail mein bata dena:)
gfg k 4 hzar a course kharid kar striver ki playlist se padh rahi hu🥲❤
same 😂
BF approach.
Public class solution {
Public static int find median(int [][]matrix,int m,int n){
Array list list =new Array list ();
for(int i=0;i
Bro! Escape the matrix
Can't it be like O(logn * logn)
For max element -> O(logn) as well
???
i dont understand
Where can I get Java code?
Striver bhai sach sach batana iska optimal solution aapne bina solution dekhe apne aap soch liya tha kya ??? And other people also tell me this...because it seems to be impossible to think the optimal sol by myself...
Bhai humari bhi yahi doubt h ! Ki ye khdse aana toh impossible lagtah
Binary Search playlist done?
Yes
when can we expect next ?@@takeUforward
Ab video ni ayegi??😢
Aapne bola tha daily ayegi ab
1st view 1st comment
Hi bhaiya can connect by some chance.recently i got call from scaler and they got very convincing as well as confusion. So I wanted to connect with you plz it Will be a big help.There is no problem in payment but plz guide me what should I do🙏
Have faith in Striver and solve more questions, no need of anything else
just try for 1 2 3 4 5 for better clarity why always returning low as answer.
This is my simple and easy to understand O(log(2000) * R * log(C)) ~ O(11 * R * log(C)) code:
int median(vector &matrix, int R, int C){
int l = 1, r = 2000;
while(l
Can't we do this l=m*n/2. d=l/rows. R=l%rows+d. Ans=matrix[d][R]
9:10
Can someone verify whether the following code is flawless? (I couldn't verify more than running it with the test case in the video)
(Python)
import math
mat = [[1, 3, 6], [2, 6, 9], [3, 6, 9]]
rows = len(mat)
cols = len(mat[0])
mini = math.inf
maxi = -math.inf
for i in range(len(mat)):
mini = min(mini, mat[i][0])
maxi = max(maxi, mat[i][cols-1])
low = mini
high = maxi
required = (rows*cols) // 2 + 1
while low
I gotta say this one is super confusing.
us
Mujhe ye median wale problem itne bekar lagti h 😢
you don't know most of the thing you are talking about!!
not a good explaination...
you are so bad in explaining
Stf,u kid.
bro watch complete video in one go with full concentration and without any distraction, and repeat it once again if you are not getting, you will definitely understand