Search a 2D Matrix
Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix.

30:00

Search a 2D Matrix
medium
Topics
Companies

Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix.

Example 1:
Input: {"matrix":[[1,3,5,7],[10,11,16,20],[23,30,34,60]],"target":3}
Output: true
Constraints:

  • m==matrix.lengthm == \text{matrix.length}

  • n==matrix[i].lengthn == \text{matrix}[i].\text{length}

  • 1≤m,n≤1001 \leq m, n \leq 100

  • −104≤matrix[i][j],target≤104-10^4 \leq \text{matrix}[i][j], \text{target} \leq 10^4

Input
arr ={"matrix":[[1,3,5,7],[10,11,16,20],[23,30,34,60]],"target":3}
Target: 3

1

3

5

7

10

11

16

20

23

30

34

60

Variables
No variables to display
DepthFunction Call
Stack empty
0/19