Problemintro
Longest subarray with at most k distinct values
Also called longest subarray with distinct elements, longest window with at most k distinct.
Find the longest subarray containing at most k distinct values; k = 1 gives the all-distinct case.
Find the longest subarray containing at most k distinct values; k = 1 gives the all-distinct case.
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 4D0T7F Edit this page History Report an error