Swiggy SDE-1 OA | Weighted Job Scheduling & Recursive String Compression

Problem 1 - Maximize Delivery Earnings Problem Statement A delivery executive has access to N delivery batches. Each batch is represented by: startTime[i] → Time when the batch becomes available endTime[i] → Time when the batch must be completed profit[i] → Earnings obtained from completing the batch The executive can work on only one batch at a time. If a batch ends at time T, another batch may start at time T or later. Return the maximum total profit that ...