Maximum Non-Overlapping Ride Revenue
Maximum Non-Overlapping Ride Revenue
HardArrays0% accepted
Ola driver Ravi has ride requests with start/end times and fares. Find the maximum total fare by accepting non-overlapping rides that maximize earnings for his 12-hour shift.
Approach
Given rides with [start_time, end_time, fare], find max fare selecting non-overlapping rides
Input
[[1,3,50],[2,5,40],[4,6,30]]
Output
80
More Arrays problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards