Good morning,

My issue is that given an array, e.g.: [1, 0, 3, 5, 7, 0, 3, 1, 8, 9, 2, 0, 1] I'd like to find the minimum position of this array whose partial sum is greater than a given number.
For example, lets say that the given number is 14.
1 is not greater than 14.
1+0 is not greater than 14.
1+0+3 is not greater than 14.
1+0+3+5 is not greater than 14.
1+0+3+5+7 THIS IS GT 14.

So I'd like to have as a result the value 5 (position of number 7 in the array).
Would that be possible to do?

Thanks a mil!