hard20 pts · first answer countsstacks-and-queues

Shortest subarray with sum at least K

You need the shortest subarray with sum at least K, and the array can contain negative numbers. Why does a plain sliding window fail, and what works?

A.Sums can overflow; switch to 64-bit integersB.Shrinking may raise the sum; use a deque of prefix sumsC.The window must be fixed; try every sizeD.Remove the negatives first, then slide as usual

Discussion 0

Join free to post in the discussion.

Shortest subarray with sum at least K

Discussion 0

Related questions