Given a matrix of integers **A** of size **N x M** and an integer **B**.

Write an efficient algorithm that searches for integar **B** in matrix **A**.

This matrix **A** has the following properties:

- Integers in each row are sorted from left to right.
- The
first integerof each row is greater than or equal to thelast integerof the previous row.

Return **1** if **B** is present in **A**, else return **0**.

**Note:** Rows are numbered from top to bottom and columns are numbered from left to right.

**Input Format**

```
The first argument given is the integer matrix A.
The second argument given is the integer B.
```

**Output Format**

```
Return 1 if B is present in A, else return 0.
```

**Constraints**

```
1 <= N, M <= 1000
1 <= A[i][j], B <= 10^6
```

**For Example**

```
Input 1:
A =
[ [1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50] ]
B = 3
Output 1:
1
Input 2:
A = [ [5, 17, 100, 111]
[119, 120, 127, 131] ]
B = 3
Output 2:
0
```

NOTE:You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

Sign Up

to access hints and editorial solutions for**Matrix Search**

to access hints and editorial solutions for

Loading...