← PayPal questions

Find the maximum sweetness of the least sweet chocolate

Filed under PayPal

Given an array of chocolate sweetness values and an integer K, divide the chocolate into K contiguous chunks such that the minimum sweetness among all chunks is maximized. Return this maximum possible…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related PayPal questions

Collected from public candidate posts and coding forums. Updated Nov 2026.