Problemintro
Longest substring with at most k distinct characters
Also called k distinct window.
Find the longest substring containing at most k distinct characters, using a sliding window with counts.
Find the longest substring containing at most k distinct characters, using a sliding window with counts.
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 AHYDH3 Edit this page History Report an error