1498. Number of Subsequences That Satisfy the Given Sum Condition
https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition
Description
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
.
Example 1:
Example 2:
Example 3:
Example 4:
Constraints:
1 <= nums.length <= 105
1 <= nums[i] <= 106
1 <= target <= 106
ac
Last updated