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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1760. Minimum Limit of Balls in a Bag

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact