Search a 2D matrix where each row and column is sorted.
Write an efficient algorithm that searches for a value target in an m x n integer matrix. Integers in each row are sorted, and the first integer of each row is greater than the last integer of the previous row.
Input: matrix = [[1,4],[2,5]], target = 20
Output: FALSE
Explanation: The target 20 is strictly greater than the largest element in the matrix (5), so the search fails immediately.

Question

Search a 2D matrix where each row and column is sorted.

Write an efficient algorithm that searches for a value target in an m x n integer matrix. Integers in each row are sorted, and the first integer of each row is greater than the last integer of the previous row.

Input: matrix = [[1,4],[2,5]], target = 20

Output: FALSE

Explanation: The target 20 is strictly greater than the largest element in the matrix (5), so the search fails immediately.

Search a 2D matrix where each row and column is sorted.

Practice this question with AI

Go Premium

No answers yet

Practice More Questions