Add solution #1589

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,387 LeetCode solutions in JavaScript
+# 1,388 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1212,6 +1212,7 @@
 1584|[Min Cost to Connect All Points](./solutions/1584-min-cost-to-connect-all-points.js)|Medium|
 1585|[Check If String Is Transformable With Substring Sort Operations](./solutions/1585-check-if-string-is-transformable-with-substring-sort-operations.js)|Hard|
 1588|[Sum of All Odd Length Subarrays](./solutions/1588-sum-of-all-odd-length-subarrays.js)|Easy|
+1589|[Maximum Sum Obtained of Any Permutation](./solutions/1589-maximum-sum-obtained-of-any-permutation.js)|Medium|
 1598|[Crawler Log Folder](./solutions/1598-crawler-log-folder.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|

solutions/1589-maximum-sum-obtained-of-any-permutation.js

@@ -0,0 +1,46 @@
+/**
+ * 1589. Maximum Sum Obtained of Any Permutation
+ * https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation/
+ * Difficulty: Medium
+ *
+ * We have an array of integers, nums, and an array of requests where requests[i] = [starti, endi].
+ * The ith request asks for the sum of nums[starti] + nums[starti + 1] + ... + nums[endi - 1]
+ * + nums[endi]. Both starti and endi are 0-indexed.
+ *
+ * Return the maximum total sum of all requests among all permutations of nums.
+ *
+ * Since the answer may be too large, return it modulo 109 + 7.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number[][]} requests
+ * @return {number}
+ */
+var maxSumRangeQuery = function(nums, requests) {
+  const MOD = 1e9 + 7;
+  const n = nums.length;
+  const freq = new Array(n + 1).fill(0);
+
+  for (const [start, end] of requests) {
+    freq[start]++;
+    freq[end + 1]--;
+  }
+
+  const count = new Array(n).fill(0);
+  let current = 0;
+  for (let i = 0; i < n; i++) {
+    current += freq[i];
+    count[i] = current;
+  }
+
+  count.sort((a, b) => b - a);
+  nums.sort((a, b) => b - a);
+
+  let total = 0;
+  for (let i = 0; i < n; i++) {
+    total = (total + nums[i] * count[i]) % MOD;
+  }
+
+  return total;
+};