Problem 725 · Medium

Split Linked List in Parts

Count the nodes, then cut them into k parts whose sizes differ by at most one, earlier parts larger.

Open the interactive visualisation