Zepto OA On-Campus 2025 | Dark Store Rider Shift Optimization & Supply Chain Route Reversal Bottleneck

Problem 1 - Dark Store Rider Shift Optimization Problem Statement A high-volume Zepto dark store tracks a set of N express delivery orders scheduled throughout the day. You are given a 2D integer array orders of size N × 2, where: orders[i] = [start, end] represents the inclusive processing interval during which the i-th order must be handled by an active delivery executive. A single delivery executive can process multiple orders sequentially only if their assigned intervals do not overlap. ...