Rapido SDE-1 OA 2024 | Maximize Captain Earnings & Bottleneck Traffic Routing

Problem 1 - Maximize Captain Earnings Problem Statement A Rapido Captain receives a list of ride requests for the day. Each ride is represented as: [start_time, end_time, earnings] The Captain can only perform one ride at a time. If a ride ends at time T, the next accepted ride must start at time T or later. Find the maximum total earnings obtainable by selecting a non-overlapping subset of rides. Constraints Constraint 1 ≤ N ≤ 105 0 ≤ start_time < ...