LeetCode 435: Non Overlapping Intervals — Step-by-Step Visual Trace

Medium — Greedy | Sorting | Intervals | Array The Problem Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. Approach Sort intervals by their end times, then gre...