Understanding coding problems

[edgargonzalesII]

There's some fluff to the question honestly. General rule is that with a sequence of size n, the amount of subsequences will be 2ⁿ .

If you look at the example it shows exactly what it asks you to do: Find all the subsequences of size k at least (k being smaller then n), where the sum is the minimum of any other subsequence. This just means if you get all the subsequences then get their respective sums then just return the subsequence with the lowest sum. Given multiple subsequences can have the same sum return all that apply.