Maximum Candies Allocated to K Children LeetCode solution in JavaScript

1
var maximumCandies = function (candies, k) {
2
  const n = candies.length;
3

4
  let left = 1;
5
  let right = 1e7 + 1;
6

7
  while (left < right) {
8
    const mid = (left + right) >> 1;
9
    const pilesAvail = divideIntoPiles(mid);
10

11
    if (pilesAvail < k) right = mid;
12
    else left = mid + 1;
13
  }
14

15
  return right - 1;
16

17
  function divideIntoPiles(pileSize) {
18
    let piles = 0;
19

20
    for (let i = 0; i < n; ++i) {
21
      const count = candies[i];
22

23
      piles += Math.floor(count / pileSize);
24
    }
25

26
    return piles;
27
  }
28
};