Kth Smallest element in a matrix | Leetcode

[@AkashGupta-sh1pd]

A very important point to mention here is that mid element may or may not exists the the matrix
But since with keep high = mid (even for the case count_smaller == k), we sort of tend to converge to the lowest element in the matrix where count_smaller == k.
Hope this helps, if not I will post link to the solution where I have written print stmt to have full clarity

[@akulajyoshnavi]

thanks..!!

[@debapriyachandra1767]

We can optimise the count function! Using 2 pointers! You can look into the discussion section

[@hymnish_you]

Thanks Bhaiya, Awesome explanation as usual.

[@techdose4u]

Always welcome

[@RishinderRana]

The best video for this problem so far

[@techdose4u]

Thanks

[@nandanimadhukar]

very good explanation and technique

[@techdose4u]

Thanks

[@prasadm3614]

Loved it !

[@techdose4u]

Thanks