Minimum Runways Required

Problem Statement

Minimum Runways Required Dubai Airport is one of the busiest in the world. You are handed the schedule of every plane that passes through it for a single day: plane i lands at time arrival[i] and takes off again at time departure[i] . A plane occupies one runway from the moment it lands until the moment it takes off, and a runway can hold only one plane at a time. Report the smallest number of runways the airport must have so that no plane ever has to circle while it waits for one to free up. Every time is written in 24-hour hhmm form, so 0930 is half past nine in the morning and 2359 is one minute before midnight. Every plane lands on the day being scheduled. When a plane's departure stamp is numerically smaller than its arrival stamp, that plane takes off the next day — a plane with arrival = 2300 and departure = 0100 is on the ground for two hours across midnight. Input Format The first line contains a single integer N , the number of planes. The second line contains N integers, the