Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2008. Maximum Earnings From Taxi
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.