Skip to content

problem11.md

Latest commit

 

History

History
14 lines (11 loc) · 549 Bytes

problem11.md

File metadata and controls

14 lines (11 loc) · 549 Bytes

Problem 11: Linear Serialization (Search a 2D Matrix)

Problem Statement

Write an efficient algorithm that searches for a value target in an m x n integer matrix 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.

Input Format

  • A 2D integer matrix matrix.
  • An integer target.

Example

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