Contiguous Array LeetCode solution in JavaScript

1
var findMaxLength = function (nums) {
2
  const hash = new Map([[0, -1]]);
3
  let result = (sum = 0);
4

5
  nums.forEach((num, index) => {
6
    sum += num === 0 ? -1 : 1;
7
    hash.has(sum)
8
      ? (result = Math.max(result, index - hash.get(sum)))
9
      : hash.set(sum, index);
10
  });
11

12
  return result;
13
};