MercadoLibre SDE OA 2025 | Inventory Batch Partitioning & Price Surge Alerting

Problem 1 - Inventory Batch Partitioning Problem Statement You are given an integer array weights where weights[i] represents the weight of the i-th inventory item. Each shipping container can hold only contiguous items and has a maximum weight capacity M. Items must remain in their original order. Return the minimum number of containers required to pack all items. If any single item exceeds M, return -1. Constraints Constraint 1 ≤ weights.length ≤ 105 1 ≤ weights[i] ≤ 109 1 ≤ ...