In the complexity part where I explained it is nlogk, n here stands for total elements in the matrix, which is actually n2.

@ritwik121

3 жыл бұрын

whats the time complexity of binary search approach?

Please explain the time complexity of the second solution.

At 11.04, how are we sure that low will hold the kth smallest element in matrix?

which leetcode you mean in 3:50 get rank of a number in sorted matrix? 1632?

when i am doing (lo+hi)/2 instead of lo + (hi-lo)/2 i am getting TLE , what is the reason for this. i am getting TLE and last excuted input is[[-5,-4],[-5,-4]] 2.

@sourin.majumdar

2 жыл бұрын

To understand why this happened watch: kzread.info/dash/bejne/mGqJt5mPY9bghto.html from 29:21

TC - for BS -> O(2*N*log(MAX-MIN)) - MAX= MAX VALUE AND MIN IS MIN VALUE

Hi ,How can we be sure that the kth element we got after bs will be there in the matrix ?

@gopinathsikha

2 жыл бұрын

Binaray search is finding the leftmost answer suitable so, we are good. {9,10,11,13}, and k = 3, if mid is 12, we will not stop at 12, we again to another round to get 11(which is leftmost). Eventually we will stop only at 11.

@tushar_agarwal_it_2nd_a_477

2 жыл бұрын

@@gopinathsikha Yes got it thanks:)

Sir , time complexity for the heap solution is nlogk or n2logk... please tell

@CodeWithSunchitDudeja

3 жыл бұрын

N2 log k, n2 are the total elements in the matrix

Thank you :)

Thanks

Woahhhhh . Crystal Clear

Awesome 🔥

@CodeWithSunchitDudeja

2 жыл бұрын

Glad you like it

hi thanks for the videos. can you please increase the sound of your voice in the videos, if possible.

@CodeWithSunchitDudeja

3 жыл бұрын

Sure, need some suggestions any idea how?

@santoshvarma996

3 жыл бұрын

the music in the starting is audible clearly but once you start speaking it goes low, may be it is my perception you can check it once from your end as well. thanks for the reply

@harpreets1602

3 жыл бұрын

@@CodeWithSunchitDudeja sir you can use the mikes of earphone ,headphone, mobile app or the professional mike.

@CodeWithSunchitDudeja

3 жыл бұрын

@@harpreets1602 Any recommendations, economical and good in quality.

@harpreets1602

3 жыл бұрын

@@CodeWithSunchitDudeja sir I have only used earphones and headphones, they work fine for me. But haven't used that professional Mike

Awesome

@CodeWithSunchitDudeja

2 жыл бұрын

Thanks

nice

@CodeWithSunchitDudeja

2 жыл бұрын

Thanks

How come the priority queue solution is O(n log k)? You have a nested for loop with both of them iterate from 0 until n. It should be O(n^2). Am I wrong?

@cinimodmil

2 жыл бұрын

yeah i think it's O(n^2) too

@varaprasaddudi9842

7 ай бұрын

overall number are n only na

7:35 Count of mid=14 will be 8, since there are only 8 elements smaller than 14. Isn't it?

@shivalikagupta3433

2 жыл бұрын

yes but its rank is 9, we need 8th smallest, that is its position should be 8.

@anandpandey4463

2 жыл бұрын

8:20 Yeah, it makes sense, but while searching for the rank of 13, ie mid = 13, there are 8 elements smaller than or equal to mid. It's count is 8, but it's rank should be 9 then, because the position here is 9. Isn't it? Also when we dry run the code, there will be one more step, when high will be set as mid, ie 13. Here low will be equal to high and thus loop ends, and when we return low, we will get our ans as 13.

Todays daily LeetCode challenge.

@CodeWithSunchitDudeja

2 жыл бұрын

Yes

Please use something better to write like a stylus and improve sound quality, the audio is too low.

Thanks