NeetCode #275LC-74MediumBinary SearchNC 150NC 250
← Back to All Problems#275 · #74 · Search a 2D Matrix(搜索二维矩阵)
📌 Problem Statement & Constraints
You are given an
m x n integer matrix with two properties: each row is sorted left to right, and the first integer of each row is greater than the last integer of the previous row. Given a target, return whether it is in the matrix. Constraints: 1 <= m, n <= 100, -10^4 <= matrix[i][j], target <= 10^4.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!