Problem 3420 · Hard

Count Non-Decreasing Subarrays After K Operations

Count subarrays that can become non-decreasing within k increments. Compare a running-maximum brute-force solution with an optimized monotonic-deque sliding window.

Open the interactive visualisation