> For the complete documentation index, see [llms.txt](https://anand-aryan.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anand-aryan.gitbook.io/leetcode/74.-search-a-2d-matrix.md).

# 74. Search a 2D Matrix

Search a 2D Matrix

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

Integers in each row are sorted from left to right. The first integer of each row is greater than the last integer of the previous row.

For example,

Consider the following matrix:

\[ \[1, 3, 5, 7], \[10, 11, 16, 20], \[23, 30, 34, 50] ]

Given target = 3, return true.

## Solution <a href="#solution" id="solution"></a>

```java
public class Solution {
    public boolean searchMatrix(int[][] matrix, int target) {
               int m = matrix.length;
        int n = matrix[0].length;

        int start = 0;
        int end = n * m - 1;

        while (start <= end) {
            int middle = start + (end - start) / 2;
            int x = middle / n;
            int y = middle % n;
            if (matrix[x][y] < target) {
                 start = middle + 1;
            } else if (matrix[x][y] > target) {
                end = middle - 1;
            } else {
                return true;
            }
        }

        return false;
    }
}
```