Problemadvanced
Shortest subarray with sum at least K
Also called shortest subarray with sum at least K with negatives.
Shortest subarray with sum at least K when elements may be negative, so the sliding window does not apply.
Shortest subarray with sum at least K when elements may be negative, so the sliding window does not apply.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag M8BX35 Edit this page History Report an error