Search a 2D Matrix — Medium Coding Interview Question

You are given an m x n integer matrix matrix with the following two properties: - Each row is sorted in non-decreasing order. - The first integer of each row is greater than the last integer of the previous row. Given an integer target, return true if target is in matrix or false otherwise. You must write a solution in O(log(m n)) time complexity.

Example

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3

Output: true

Constraints

• m == matrix.length
• n == matrix[i].length
• 1 ≤ m, n ≤ 100
• -10⁴ ≤ matrix[i][j], target ≤ 10⁴

Topics & Companies

Topics: binary-search, arrays

Asked by: Amazon, Google, Meta, Microsoft

Optimal Solution Complexity

Time complexity: O(log(m * n)). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns