Back to all solutions
#74 - Search a 2D Matrix
Problem Description
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.
Solution
/**
* @param {number[][]} matrix
* @param {number} target
* @return {boolean}
*/
var searchMatrix = function(matrix, target) {
return matrix
.filter(row => row[0] <= target && row[row.length - 1] >= target)
.find(row => row.includes(target)) !== undefined;
};