Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1760. Minimum Limit of Balls in a Bag
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source