Fewest Intervals to Cover a Range
Medium
Interval Greedy Problems
Given intervals and a target range [a, b], print the fewest intervals needed to cover the whole range, or -1.
Constraints
1 <= n <= 10^5
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.