Leetcode 2226. Maximum Candies Allocated to K Children

Given piles you can split but not merge, find the largest integer x such that you can form at least k piles of size x (i.e., sum floor(candies[i]/x) >= k). This is typically solved by binary-searching the possible pile size x and checking feasibility.

Asked at:

Question Timeline

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

Company

Level

Region

Early August, 2025

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 2226. Maximum Candies Allocated to K Children

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact