Sonata Software GET OA 2025 | Inventory Stock Partitioning & Shipping Window Optimization

Problem 1 - E-Commerce Inventory Stock Partitioning Problem Statement You are given an integer array stockAdjustments representing sequential inventory updates. Return the leftmost pivot index where: The sum of elements strictly to the left equals the sum of elements strictly to the right. If the pivot is at index 0, the left sum is considered 0. If the pivot is at the last index, the right sum is considered 0. If no such pivot exists, return -1. Constraints Constraint 1 ...