Leetcode Solution - 997. Find the Town Judge

findJudge.js

const findJudge = (N, trust) => {
  const p = new Array(N + 1).fill(0);
  for (let [i, j] of trust) {
    --p[i];
    ++p[j];
  }
  for (let i = 1; i < p.length; ++i) if (p[i] === N - 1) return i;
  return -1;
};

Result
Runtime: 120 ms, faster than 57.32% of JavaScript online submissions for Find the Town Judge.
Memory Usage: 46.6 MB, less than 62.00% of JavaScript online submissions for Find the Town Judge.