What will be the TC for this problem?
Sorted Matrix Search
so if u use brute force method complexity would be O(N*M)…
but optimally it would be solved in O(M + N).
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.