Problemintro
Maximum sum subarray of fixed length
Also called maximum average subarray of length k, maximum sum window of size k.
Find the length-k window of an array with the largest sum.
Find the length-k window of an array with the largest sum.
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 5NYQY1 Edit this page History Report an error