← Questions
Most consecutive elements from an index whose sum stays below a target
0
I was asked this
No reports yet. Sign in to say where you were asked it.
You get a non-decreasing array, a start index and a target. Return how many consecutive elements, starting at that index, can be added while the sum stays below the target. Use prefix sums and binary search so many queries are cheap.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding