Company: Capital One_3july
Difficulty: medium
Package Distribution System Problem Description You're managing a network of distribution centers that handle package deliveries. Each center has a different capacity for processing packages before needing a reset. You are given an array of integers centerCapacities , where centerCapacities[i] is a value between 1 and 5 representing the maximum number of packages that the i-th distribution center can process before requiring maintenance. You are also given an array of strings dailyLog , where dailyLog[i] can be one of the following: "PACKAGE" - a new package arrives for processing "CLOSURE <j>" - the j-th distribution center temporarily closes for renovations Packages are sent to centers in sequential order. Each center processes as many packages as it can based on its capacity defined by centerCapacities[i] before packages are sent to the next available center. After a complete rotation through all centers (returning to center 0), the capacity of all operational centers is resto