Available question text
Choose a set of non-overlapping rides (you travel one-way and carry at most one passenger) to maximize total profit, where each ride's profit = end - start + tip. This is a weighted interval scheduling problem — pick compatible intervals to maximize sum, typically solved by sorting rides and using DP with binary search / a map for efficient lookup.
Related questions
Continue with questions that share topics or the same question type.
- Find Maximum Removals From Source String
Coding
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Maximum Calories Burnt from Jumps
Coding · Array · Greedy · Sorting
- Maximum Candies You Can Get from Boxes
Coding · Array · Breadth-First Search · Graph Theory
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2008. Maximum Earnings From Taxi
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source