Toffee Boxes
Filed under Directi
The question
Given N toffee packets with varying counts, divide them into M contiguous boxes such that each box has at least one packet and the maximum sum of toffees in any box is minimized.
No write-up yet. Related questions below have one.
Related Directi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.