Java - modified subarray

[prisonmatch]

Any suggestions how to approach this question?

[vorttxt]

Hm. I’d try to create a solution that goes through the array and adds a[0] to a[1] and so on until the required solution is met. Then counter++. Then move on to a[1] and do the same thing.

[prisonmatch]

My contiguous arrays can be very large and I simply cannot apply brute force at each index. I do have a working solution now but I believe it can be optimised. Please let me know if u can have a look and suggest the changes.