Can Make Palindrome from Substring LeetCode solution in JavaScript

1
const getBitCount = (n) => {
2
  let cnt = 0;
3
  while (n > 0) {
4
    cnt += n & 1;
5
    n >>= 1;
6
  }
7
  return cnt;
8
};
9

10
var canMakePaliQueries = function (s, queries) {
11
  const masks = [0],
12
    base = "a".charCodeAt(0);
13
  let mask = 0;
14
  for (let c of s) {
15
    mask ^= 1 << (c.charCodeAt(0) - base);
16
    masks.push(mask);
17
  }
18
  return queries.map(([l, r, k]) => {
19
    const cnt = getBitCount(masks[l] ^ masks[r + 1]);
20
    return cnt - 1 <= 2 * k;
21
  });
22
};