into consecutive parts with size difference at most 1, and earlier parts are a larger size than the later parts.

Solution

First, we calculate the total length of the linked list by traversing it with a while loop. We use a helper function size to find the length of the linked list, from Find the length of the linked list.
We calculate two key values:
- m: The minimum guaranteed size of each part, found by dividing the total length by k.
- r: The number of extra nodes to distribute among the first r parts, which is the remainder of the division.
We use the curr pointer to traverse the linked list. We then loop through each part:
- Store the current node as the start of the current part in the parts</