Search an element in sorted Matrix( row and column sorted)

[@HeroesOfAesthetics]

best explanation on RUclips!!!

[@Pratimbiswasss]

Sir thankyou for helping me to build the kind of logic i needed to solve this type of question...

[@nitishiter]

My assumption is we can optimize the code even further by making use of the binary search and turning the runtime complexity to be logarithmic.
Here is a sample code from leetcode submission:
public boolean searchMatrix(int[][] matrix, int target) {
int row_num = matrix.length;
int col_num = matrix[0].length;
int begin = 0, end = row_num * col_num - 1;
while(begin

[@gujjulapradeepreddy3189]

Excellent explanation sir.

[@nishadkumar7322]

Great walkthrough!

[@gauravparkash162]

clear and nice explanation ..great work keep doing

[@algorithmimplementer415]

I think the time complexity is O(min (m, n)) where m and n are rows and cols of the matrix respectively. Please correct me if I am wrong.

[@decayingSineWave]

correct

[@arnavkarforma3015]

I think worst time complexity will be O(m + n)

[@lineage-darkelf]

Sir, Thanks for your sharing! It is quite useful. By the way, could you please share how to solve the similar problem, "Kth Smallest Element in a Sorted Matrix"?

[@praveenchouhan6388]

awesome explaination as always but you missed on the running time complexity of this approach, but i believe it will be O(n+m) time where n and m are rows and columns and space will be constant space!!!!!!!!

[@kirankutte7073]

How n+m

[@jjddpphh]

bruh u saved my life

[@koushikchiku5015]

sir ur videos are very helpfull.
sir please upload a video on sudoku solving.backtraking !!please sir

[@anmolgautam19]

what's the time complexity?

[@VishalGupta_5083]

Sir iss form mai matrix ko sort kaise kiya hai?
Agar column wise sorting ki hai to last ke row mai error hai first two columns

[@the-gray-haired-developer]

please add more videos on matrix related problems

[@fsbonilha]

Thanks bro!

[@MrMarkgyuro]

this is high quality!

[@mukhtarali1318]

sir, could you upload a video explaining solution of "longest alternatin(zig-zig) subsequence" please...

[@haria8779]

Thanks much!

[@Huntyoudown2020]

🤟

[@pravesh8187]

thanks sir

[@arunreddy5607]

This is failing for the input matrix {{-1,3}} and matrix{{1,1}} . Can you please tell me how to fix this?

[@gokul5293]

Your matrix is not in increasing order.

[@priyadebnath6896]

Thanks😄

[@kiranmahajan778]

TIme complexity?

[@arnavkarforma3015]

worst time complexity O(m+ n)

[@sumanthchowdary9699]

def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
j = len(matrix) -1
i = 0
if j is None:
return 'false'
while i = 0:
if matrix[i][j] == target:
return 'true'
elif matrix[i][j] > target:
j -= 1
elif matrix[i][j] < target:
i += 1
return 'false'
can u correct my code?

[@vikrantsanke3554]

in the first example,it will return false if we search for 46, because 46>40 and row will get incremented. Also in the second example, same would happen for 21 and 31