Add solution #1508

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,336 LeetCode solutions in JavaScript
+# 1,337 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1152,6 +1152,7 @@
 1504|[Count Submatrices With All Ones](./solutions/1504-count-submatrices-with-all-ones.js)|Medium|
 1505|[Minimum Possible Integer After at Most K Adjacent Swaps On Digits](./solutions/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits.js)|Hard|
 1507|[Reformat Date](./solutions/1507-reformat-date.js)|Easy|
+1508|[Range Sum of Sorted Subarray Sums](./solutions/1508-range-sum-of-sorted-subarray-sums.js)|Medium|
 1512|[Number of Good Pairs](./solutions/1512-number-of-good-pairs.js)|Easy|
 1519|[Number of Nodes in the Sub-Tree With the Same Label](./solutions/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.js)|Medium|
 1524|[Number of Sub-arrays With Odd Sum](./solutions/1524-number-of-sub-arrays-with-odd-sum.js)|Medium|

solutions/1508-range-sum-of-sorted-subarray-sums.js

@@ -0,0 +1,41 @@
+/**
+ * 1508. Range Sum of Sorted Subarray Sums
+ * https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/
+ * Difficulty: Medium
+ *
+ * You are given the array nums consisting of n positive integers. You computed the sum of all
+ * non-empty continuous subarrays from the array and then sorted them in non-decreasing order,
+ * creating a new array of n * (n + 1) / 2 numbers.
+ *
+ * Return the sum of the numbers from index left to index right (indexed from 1), inclusive,
+ * in the new array. Since the answer can be a huge number return it modulo 109 + 7.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} n
+ * @param {number} left
+ * @param {number} right
+ * @return {number}
+ */
+var rangeSum = function(nums, n, left, right) {
+  const MOD = 1e9 + 7;
+  const sums = [];
+
+  for (let start = 0; start < n; start++) {
+    let currentSum = 0;
+    for (let end = start; end < n; end++) {
+      currentSum += nums[end];
+      sums.push(currentSum);
+    }
+  }
+
+  sums.sort((a, b) => a - b);
+
+  let result = 0;
+  for (let i = left - 1; i < right; i++) {
+    result = (result + sums[i]) % MOD;
+  }
+
+  return result;
+};