values of length n and an integer goal.
A **basket** is any subsequence of values: you choose elements by position and keep their order. There are 2ⁿ baskets, the empty one and the whole array included. Equal values at different positions count as different elements.
The **weight** of a basket is the number of its own subsequences whose sum is exactly goal.
Return the total weight of all baskets. The answer can be huge, so return it modulo 10⁹ + 7.values=[2, 1, 1], goal=2 → 6
Two picks sum to 2: [2] and [1, 1]. The pick [2] lies in 4 baskets (each 1 may or may not be added), and [1, 1] lies in 2. In total, 4 + 2 = 6.
values=[5, 6], goal=4 → 0
Every element exceeds 4, so no basket can reach a sum of 4.
values=[3], goal=3 → 1
values=[2, 1, 1], goal=2
6
Run checks the first 3 tests in your browser. Submit checks all 80 tests on the server, hidden ones included.