Greedy Algorithms - Minimum Platforms (Train Stations)
Consider two approaches to find the minimum number of platforms: (1) sorting arrivals and departures with two pointers, and (2) using a min-heap to track earliest departure. When is the min-heap approach preferable over the two-pointer approach?
