Swiggy SDE-1 Online Assessment 2024 | Delivery Fleet Bottleneck Minimization & Instamart Shift Demand Partitioning

Problem 1 - Delivery Fleet Bottleneck Minimization Problem Statement Swiggy is optimizing its onboarding operations along a linear delivery corridor. You are given two integer arrays of size N: executives - the positions of delivery executives. bikes - the positions of parked delivery bikes. You must assign exactly one unique bike to each delivery executive. The travel time for an executive is defined as: abs(executive_position - bike_position) Your goal is to minimize the maximum travel time among all executives. Return ...