Leetcode 1760. Minimum Limit of Balls in a Bag

Given bags with ball counts and a limit on splitting operations, minimize the maximum balls in any bag after at most maxOperations splits. This is solved by binary-searching the possible maximum penalty and greedily checking feasibility (counting required splits per bag), yielding an O(n log M) solution for large nums.