Blinkit SDE-1 Hiring Challenge 2024 | Diverse Delivery Cart Optimization & Dark Store Autonomous Picker Routing

Problem 1 - Diverse Delivery Cart Optimization Problem Statement A Blinkit dark store uses a high-speed conveyor belt to move items to the packing station. You are given an integer array categories of size N, where categories[i] represents the product category ID of the i-th item passing down the belt. To maximize packing throughput, a packing machine needs to select a contiguous segment of items to process together. However, due to sorting bin limitations, the selected segment can contain at ...