Problemintro
Activity selection
Also called Interval scheduling, Maximum set of non-overlapping intervals, Minimum removals to make intervals disjoint, interval scheduling, interval scheduling maximization, maximum disjoint intervals.
Choose the maximum number of pairwise non-overlapping intervals.
Choose the maximum number of pairwise non-overlapping intervals.
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 AGT6N3 Edit this page History Report an error