Flights

Problem Overview

• Compute when the final round trip is completed using flight schedules, always taking the earliest available flights; each leg lasts 100 minutes.
• Inputs: two arrays of departure times (outbound and return) and an integer for the number of round trips; output: the minute when the last round trip ends.
• Real-world context: scheduling round-trip air travel between two destinations with fixed durations and earliest-boarding policy.
• From Trade_desk interviews; a coding interview problem and interview question focused on timing and scheduling.