Brick wall Leetcode solution

brick-wall.js

const wall = [
  [1, 2, 2, 1],
  [3, 1, 2],
  [1, 2, 2],
  [2, 4],
  [3, 1, 2],
  [1, 3, 1, 1]
]

const leastBricks = (wall) => {
  const times = {}

  for(let row of wall) {
    let sum = 0

    for(let j = 0; j < row.length - 1; j++) {
      sum += row[j]

      if(times[sum]) {
        times[sum] += 1
      } else {
        times[sum] = 1
      }
    }
  }

  let maxBypassedBricks = 0

  for(let sum of Object.values(times)) {
    maxBypassedBricks = Math.max(maxBypassedBricks, sum)
  }

  return wall.length - maxBypassedBricks
}

console.log(leastBricks(wall))