Number of Subsequences That Satisfy the Given Sum Condition

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.