← Questions
Divide a bar into k+1 pieces to maximize the smallest piece
0
I was asked this
No reports yet. Sign in to say where you were asked it.
An array of positive integers describes consecutive chunks of a bar. Make exactly k cuts so the bar becomes k + 1 contiguous pieces, and you keep the piece with the smallest sum. Return the largest smallest-piece sum you can get.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding