##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Minimum removals
Given intervals, find the minimum number of intervals to remove so the rest are non-overlapping. Example: needs 1 removal.
Remove and the rest don't overlap. You're solving the complement of interval scheduling: minimize removals = maximize kept intervals. Constraints: up to intervals.
