Max Value of Equation LeetCode solution in JavaScript

1
var findMaxValueOfEquation = function (points, k) {
2
  let result = -Infinity;
3
  let queue = [];
4
  for (let point of points) {
5
    while (queue.length && point[0] - queue[0][1] > k) {
6
      queue.shift();
7
    }
8
    if (queue.length) {
9
      result = Math.max(result, queue[0][0] + point[1] + point[0]);
10
    }
11
    while (queue.length && point[1] - point[0] > queue[queue.length - 1][0]) {
12
      queue.pop();
13
    }
14
    queue.push([point[1] - point[0], point[0]]);
15
  }
16
  return result;
17
};