74.js

// 74. Search a 2D Matrix
// https://leetcode.com/problems/search-a-2d-matrix/
// Submission 1: https://leetcode.com/submissions/detail/771903665/
// Submission 2: https://leetcode.com/submissions/detail/771909539/

const searchMatrix = (matrix, target) => {
  // First Submission
  // 93.70% less memory usage and 31.02% runtime
  // for (let i = 0; i < matrix.length; i++) {
  //     if (matrix[i].includes (target)) return true
  // }
  // return false


  // Second Submission
  // 82.97% faster runtime and 18.55% less memory usage
  for (let i = 0; i < matrix.length; i++) {
    const new_set = new Set(matrix[i])
    if (new_set.has(target)) return true
  }
  return false
}


// Test Examples

console.log(searchMatrix(
  [[1,3,5,7],[10,11,16,20],[23,30,34,60]],
  3)) // true

console.log(searchMatrix([[1,3,5,7],[10,11,16,20],[23,30,34,60]],
  13
  )) // false