Maximum Sum Obtained of Any Permutation LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @param {number[][]} requests
4
 * @return {number}
5
 */
6
var maxSumRangeQuery = function (nums, requests) {
7
  let frequency = new Array(nums.length).fill(0);
8
  for (let req of requests) {
9
    for (let i = req[0]; i <= req[1]; i++) {
10
      frequency[i]++;
11
    }
12
  }
13
  nums = nums.sort((a, b) => a - b);
14
  let freqArr = frequency.sort((a, b) => b - a);
15
  let sum = 0;
16
  for (let freq of freqArr) {
17
    sum += freq * nums.pop();
18
  }
19
  const mod = 10 ** 9 + 7;
20
  return sum % mod;
21
};