Skip to main content
Talentd

The Latest Time to Catch a Bus - Solution & Explanation

MediumArrayTwo PointersBinary SearchSorting14 min readAsked at: Microsoft, Meta, Google
Practice this problem

Problem Statement

You are given a 0-indexed integer array buses of length n, where buses[i] represents the departure time of the ith bus. You are also given a 0-indexed integer array passengers of length m, where passengers[j] represents the arrival time of the jth passenger. All bus departure times are unique. All passenger arrival times are unique.

You are given an integer capacity, which represents the maximum number of passengers that can get on each bus.

When a passenger arrives, they will wait in line for the next available bus. You can get on a bus that departs at x minutes if you arrive at y minutes where y <= x, and the bus is not full. Passengers with the earliest arrival times get on the bus first.

More formally when a bus arrives, either:

  • If capacity or fewer passengers are waiting for a bus, they will all get on the bus, or
  • The capacity passengers with the earliest arrival times will get on the bus.

Return the latest time you may arrive at the bus station to catch a bus. You cannot arrive at the same time as another passenger.

Note: The arrays buses and passengers are not necessarily sorted.

 

Example 1:

Input: buses = [10,20], passengers = [2,17,18,19], capacity = 2
Output: 16
Explanation: Suppose you arrive at time 16.
At time 10, the first bus departs with the 0th passenger. 
At time 20, the second bus departs with you and the 1st passenger.
Note that you may not arrive at the same time as another passenger, which is why you must arrive before the 1st passenger to catch the bus.

Example 2:

Input: buses = [20,30,10], passengers = [19,13,26,4,25,11,21], capacity = 2
Output: 20
Explanation: Suppose you arrive at time 20.
At time 10, the first bus departs with the 3rd passenger. 
At time 20, the second bus departs with the 5th and 1st passengers.
At time 30, the third bus departs with the 0th passenger and you.
Notice if you had arrived any later, then the 6th passenger would have taken your seat on the third bus.

 

Constraints:

  • n == buses.length
  • m == passengers.length
  • 1 <= n, m, capacity <= 105
  • 2 <= buses[i], passengers[i] <= 109
  • Each element in buses is unique.
  • Each element in passengers is unique.

Approach Overview

Problem Overview: You are given departure times of buses, arrival times of passengers, and a capacity for each bus. Passengers board the earliest bus they can catch until capacity is full. The task is to determine the latest possible time you can arrive at the station and still board a bus, while ensuring your arrival time does not match any existing passenger time.

Approach 1: Sorted Two-Pointer Simulation (O(n log n + m log m) time, O(1) extra space)

Sort both the buses and passengers arrays. Then simulate the boarding process using two pointers. Iterate through buses in chronological order and greedily assign passengers who arrive before or at the bus departure until the bus reaches capacity. After processing the last bus, determine the latest valid arrival time: if the bus still has space, you can arrive exactly at its departure; if it is full, the candidate time becomes one minute before the last boarded passenger. Decrease the time while it conflicts with existing passenger arrival times. The technique relies on sorted traversal and pointer advancement, a common pattern in Two Pointers and Array problems.

Approach 2: Greedy Backtrack with Binary Search (O((n + m) log m) time, O(1) space)

Another strategy treats the answer as a search problem. First sort buses and passengers. Use Binary Search to test candidate arrival times. For each candidate time, simulate whether boarding is possible by greedily assigning passengers to buses while including the hypothetical arrival. If the candidate time allows boarding, move the search window later; otherwise move earlier. After finding the latest feasible time, backtrack if that timestamp coincides with an existing passenger arrival. This approach separates feasibility checking from answer discovery, which can be useful when constraints grow or the boarding rule becomes more complex.

Recommended for interviews: The sorted two-pointer simulation is the expected solution. It directly models the boarding process and runs in O(n log n + m log m) due to sorting. Interviewers prefer this approach because the logic is transparent and easy to reason about. The binary-search variant shows deeper algorithmic thinking but adds unnecessary complexity for this specific problem.

Approach 1: Sorted Two-Pointer Approach

To solve this problem, we employ a two-pointer technique after sorting both the buses and passengers arrays. The bus with the latest departure time will determine your latest possible arrival time.

Throughout, we'll track which passengers can board each bus until no more passengers can fit or there are no waiting passengers. Eventually, check when you can arrive just before the last passenger eligible for the last bus.

Sort the buses and passengers. For each bus, assign passengers whose arrival is before or equal to the departure, counting how many board. Adjust the potential arrival time backward until a free slot is found.

Code

PythonJavaJavaScript

Python

Java

JavaScript

Complexity

Time Complexity: O((n + m) log(n + m)) due to sorting.
Space Complexity: O(1) for in-place operations.

Try this approach in the editor →

Approach 2: Greedy Backtrack Approach with Binary Search

This method determines the latest optimal time to arrive by initially supposing you arrive at the bus's latest possible time, backtracking from there while enforcing the unique arrival constraint. By leveraging binary search over the passenger list, we assure minimal comparison operations.

Here, binary search is used to minimize list traversal and repetitive checks while iterating for each passenger on a given bus. With optimal sorting, this method converges on the last plausible time you can catch the bus without syncing with another passenger.

Code

CC++

C

C++

Complexity

Time Complexity: O((n + m) log(n + m))
Space Complexity: O(1)

Try this approach in the editor →

Approach 3: Simulation

First, we sort, and then use double pointers to simulate the process of passengers getting on the bus: traverse the bus bus, passengers follow the principle of "first come, first served".

After the simulation ends, judge whether the last bus still has seats:

  • If there are seats, we can arrive at the bus station when the bus departs at bus[|bus|-1]; if there are people at this time, we can find the time when no one arrives by going forward.
  • If there are no seats, we can find the last passenger who got on the bus, and find the time when no one arrives by going forward from him.

The time complexity is O(n times log n + m times log m), and the space complexity is O(log n + log m). Where n and m are the numbers of buses and passengers respectively.

Code

PythonJavaC++GoTypeScriptJavaScript

Python

Java

C++

Go

TypeScript

JavaScript

Try this approach in the editor →

Complexity Comparison

ApproachComplexity
Sorted Two-Pointer Approach

Time Complexity: O((n + m) log(n + m)) due to sorting.
Space Complexity: O(1) for in-place operations.

Greedy Backtrack Approach with Binary Search

Time Complexity: O((n + m) log(n + m))
Space Complexity: O(1)

Simulation—

Detailed Complexity Analysis

ApproachTimeSpaceWhen to Use
Sorted Two-Pointer SimulationO(n log n + m log m)O(1)Best general solution. Efficient when buses and passengers can be sorted and simulated sequentially.
Greedy Backtrack with Binary SearchO((n + m) log m)O(1)Useful when treating the answer as a search space or when feasibility checks are easier than direct computation.

Video Solution

The Latest Time to Catch a Bus - 2332. LEET CODE • Web Mickey • 2,283 views views

Watch 7 more video solutions →

Frequently Asked Questions

Is The Latest Time to Catch a Bus easy or hard?
The problem is rated Medium because the logic requires careful simulation and handling of edge cases such as full buses and duplicate passenger arrival times. The algorithm itself is straightforward once you recognize that sorting and greedy boarding lead to the correct answer.
The Latest Time to Catch a Bus Python/Java solution
Typical implementations sort the buses and passengers arrays, then simulate boarding with two pointers. Python, Java, and JavaScript versions usually follow the same greedy structure: iterate buses, board passengers until capacity, and compute the latest safe arrival time that does not match existing passenger timestamps.
How to solve The Latest Time to Catch a Bus in O(n)?
An exact O(n) solution is generally not possible because the passenger and bus schedules must be processed in chronological order. Sorting both arrays is required unless the inputs are already sorted. Once sorted, the boarding simulation itself runs in linear O(n + m) time using two pointers.
What is the best approach for The Latest Time to Catch a Bus?
The sorted two-pointer simulation is the most practical solution. Sort buses and passengers, then simulate the boarding process while tracking capacity. After the last bus is processed, compute the latest valid arrival time that does not conflict with existing passengers. This approach runs in O(n log n + m log m) time due to sorting.
Is The Latest Time to Catch a Bus asked at Google/Amazon/Meta?
This problem represents a common scheduling and simulation pattern frequently used in technical interviews at companies like Amazon, Google, and Meta. Variants involving resource allocation, queues, and greedy boarding logic appear regularly in interview rounds.
What data structure is used in The Latest Time to Catch a Bus?
The solution primarily uses arrays with sorting and a two-pointer traversal. No complex data structures are required. Some implementations also use sets or pointer checks to avoid choosing a time that already exists in the passenger list.
What is the time complexity of The Latest Time to Catch a Bus?
The optimal approach runs in O(n log n + m log m) time where n is the number of buses and m is the number of passengers. The complexity comes from sorting both arrays. The actual boarding simulation uses a linear two-pointer scan with O(n + m) time and O(1) additional space.

Ready to solve this problem?

Practice The Latest Time to Catch a Bus with our built-in code editor and test cases.

Practice on FleetCode
Previous

Maximum Matching of Players With Trainers

Next

Minimum Speed to Arrive on Time