hard20 pts · first answer countsarraysprefix-sumsdeque
Shortest subarray with sum at least K, with negatives
With negative numbers allowed, which approach finds the shortest subarray with sum at least K in O(n)?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of reading arr[i]Backend Developer
- Inserting at the front of an arrayBackend Developer
- Why push is amortized O(1)Backend Developer
- Changing one character of a stringBackend Developer
- Reversing a simple stringBackend Developer
- slice vs spliceBackend Developer
- Index of the last elementBackend Developer
- indexOf and NaNBackend Developer