Skip to content

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.

 public boolean searchMatrix(int[][] matrix, int target) {
        int col = matrix[0].length-1;
		int row = 0;
		while(row <= matrix.length -1 && col >= 0){
			if(matrix[row][col] == target) 	return true;
			else if(matrix[row][col] < target) row++;
			else col--;
		return false;
Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: