Brick Wall LeetCode solution in JavaScript

1
var leastBricks = function (wall) {
2
  const hash = wall.reduce((map, row) => {
3
    let sum = 0;
4

5
    for (let index = 0; index < row.length - 1; index++) {
6
      sum += row[index];
7
      const hashCount = map.get(sum) ?? 0;
8
      map.set(sum, hashCount + 1);
9
    }
10
    return map;
11
  }, new Map());
12

13
  let result = wall.length;
14
  hash.forEach((value) => (result = Math.min(result, wall.length - value)));
15

16
  return result;
17
};