You are given head of a singly linked list and an integer, k. Your task is to split the linked list into k consecutive parts.

• Each part should have a size as equal as possible, with the difference between any two parts being at most $1$.

• If the list cannot be evenly divided, the earlier parts should have more nodes than the later ones.

• Any parts that cannot be filled with nodes should be represented as NULL.

• The parts must appear in the same order as in the input-linked list.

Return an array of the k parts, maintaining the specified conditions.

Constraints:

• The number of nodes in the list is in the range $[0, 10^{3}]$.

• $0 \leq$ Node.value $\leq 10^{3}$

• $1 \leq$ k $\leq 50$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding on how to solve this problem.

Implement your solution in the following coding playground.