Splitting array into k fragments to minimize the largest sum
Array
Fragments (k)
Start
⏮
◀
▶ Play
▶
⏭
Speed
3/s
Draw the entire history immediately
Show the entire plot