Add solution #1498

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,330 LeetCode solutions in JavaScript
+# 1,331 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1145,6 +1145,7 @@
 1494|[Parallel Courses II](./solutions/1494-parallel-courses-ii.js)|Hard|
 1496|[Path Crossing](./solutions/1496-path-crossing.js)|Easy|
 1497|[Check If Array Pairs Are Divisible by k](./solutions/1497-check-if-array-pairs-are-divisible-by-k.js)|Medium|
+1498|[Number of Subsequences That Satisfy the Given Sum Condition](./solutions/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js)|Medium|
 1502|[Can Make Arithmetic Progression From Sequence](./solutions/1502-can-make-arithmetic-progression-from-sequence.js)|Easy|
 1507|[Reformat Date](./solutions/1507-reformat-date.js)|Easy|
 1512|[Number of Good Pairs](./solutions/1512-number-of-good-pairs.js)|Easy|

solutions/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.js

@@ -0,0 +1,42 @@
+/**
+ * 1498. Number of Subsequences That Satisfy the Given Sum Condition
+ * https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/
+ * Difficulty: Medium
+ *
+ * You are given an array of integers nums and an integer target.
+ *
+ * Return the number of non-empty subsequences of nums such that the sum of the minimum and
+ * maximum element on it is less or equal to target. Since the answer may be too large,
+ * return it modulo 109 + 7.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var numSubseq = function(nums, target) {
+  const MOD = 1e9 + 7;
+  const sortedNums = nums.sort((a, b) => a - b);
+  const length = nums.length;
+  let result = 0;
+  const powers = new Array(length).fill(1);
+
+  for (let i = 1; i < length; i++) {
+    powers[i] = (powers[i - 1] * 2) % MOD;
+  }
+
+  let left = 0;
+  let right = length - 1;
+
+  while (left <= right) {
+    if (sortedNums[left] + sortedNums[right] <= target) {
+      result = (result + powers[right - left]) % MOD;
+      left++;
+    } else {
+      right--;
+    }
+  }
+
+  return result;
+};