Leetcode 1231. Divide Chocolate

Given an array of sweetness values for sequential chocolate chunks, partition it into k+1 contiguous pieces so as to maximize the minimum total sweetness among the pieces. This is a maximin partitioning problem usually solved by binary-searching the answer with a greedy feasibility check.

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 1231. Divide Chocolate

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact