Problem Statement

Shuttle Missions Shuttle Missions Problem Description A transit system connects two major hubs, Alpha and Beta, using scheduled shuttles. Every shuttle traveling from Alpha to Beta takes 100 time units to arrive, and departure times are listed in the sorted integer array alpha2beta . Shuttles heading back from Beta to Alpha likewise take 100 time units, with departures given in the sorted integer array beta2alpha . You must finish a number of missions , where each one means traveling from Alpha to Beta and then returning to Alpha, completed strictly one after another. Work out the time unit at which the final mission finishes, assuming you always board the earliest shuttle available for each leg. It is guaranteed that all missions can be completed given the shuttle schedules provided. All times are measured in time units from the start of your journey. Note: You are not expected to provide the most optimal solution, but a solution with time complexity not worse than O(missions * (alpha