Maximum Non-Overlapping Intervals

Challenge on lesson: Checkpoint — Prove It or Lose It

CHALLENGE

Difficulty: advanced+25 XP

**Bài toán.** n intervals [s, e]; choose the maximum count of pairwise non-overlapping intervals. Touching endpoints (e1 == s2) count as OVERLAPPING. n ≤ 200000; coordinates ≤ 10^9. **Output:** one integer.

Press Submit to check your solution.

Back to lesson: Checkpoint — Prove It or Lose It