Given an integer array nums and an integer target, count how many non empty subsequences of nums satisfy the following condition: if minVal is the minimum element in the subsequence and maxVal is the maximum element in the subsequence, then minVal + maxVal <= target.

Return the number of such subsequences modulo $10^9 + 7$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^6$

• $1 \leq$ target $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.