Search a 2D Matrix II
Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: Integers in each row are sorted in ascending from left to right. Integers in each column are sorted in ascending from top to bottom.

30:00

Search a 2D Matrix II
medium
Topics
Companies

Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: Integers in each row are sorted in ascending from left to right. Integers in each column are sorted in ascending from top to bottom.

Example 1:
Input: {"matrix":[[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]],"target":5}
Output: true
Constraints:

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

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

  • 1≤n,m≤3001 \leq n, m \leq 300

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

  • All integers in each row are sorted in ascending order.

  • All integers in each column are sorted in ascending order.

Input
arr ={"matrix":[[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]],"target":5}

Start at top-right

1

4

7

11

15

2

5

8

12

19

3

6

9

16

22

10

13

14

17

24

18

21

23

26

30

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