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.