can v solve this in the way v hav done for merging k sorted array and then v cn find out the kth element in that sorted array
Kth smallest element in row wise and col wise sorted array
yes u can but then think about the time complexity factor as well
if it is less than or equal to discussed in code then well and good
and also think of the efforts
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.