# You're on a remote island that needs evacuation due to pending flooding.
# The government is sending planes tomorrow to get some people out.
# If you miss the last plane you'd have to take a slower boat the following day which you don't want.
# Given the plane schedule and the schedule of all your fellow islanders,
# What is the latest you could get to the airport tomorrow and still get evacuated?
This Google interview problem describes an evacuation scenario: multiple flights leave the island tomorrow, and every islander has their own arrival time at the airport. Assuming planes fill up in departure-time order and seats are taken by whoever arrives earlier, you must compute the latest time you personally can arrive at the airport and still guarantee a seat on some plane, instead of being forced onto the slow boat. It tests your ability to model schedules, capacities, and ordering, often using sorting and careful simulation or greedy reasoning.
END
