15% off all plans & roadmaps Use code
See plans
Preparing this workspace.
LeetCode 2226 · Solution & editorial
You are given a 0-indexed integer array candies. Each element in the array denotes a pile of candies of size candies[i]. You can divide each pile into any number of sub piles, but you cannot merge two piles together.
Maximum Candies Allocated to K Children is a Binary Search Patterns problem, in the On Answer / Condition Function subpattern. The pattern covers standard binary search, rotated arrays, first/last occurrence, and search on answer space
Learn binary search on answer space for optimization problems like Koko eating bananas and capacity to ship packages.
The reference solution runs in O(nlogr) time and O(1) space.
The full editorial is part of Pro
It explains the core insight, the complexity analysis and the common mistakes, with a worked solution.
Maximum Candies Allocated to K Children is a Binary Search Patterns problem, in the On Answer / Condition Function subpattern. Once the approach above makes sense, write it yourself and then work through the neighbouring problems that reuse it.