Given a circular linked list, list, of positive integers, split it into two circular linked lists. The first circular linked list should contain the first half of the nodes (exactly ⌈list.length / 2⌉ nodes) in the same order they appeared in the original list, while the second circular linked list should include the remaining nodes in the same order.

Return an array, answer, of length 2, where:

• answer[0] is the head of the circular linked list representing the first half.

• answer[1] is the head of the circular linked list representing the second half.

Note: A circular linked list is a standard linked list where the last node points back to the first node.

Constraints:

Let n be the number of nodes in a linked list.

• 2 $\leq$n $\leq$$10^{3}$

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

• LastNode.next = FirstNode where LastNode is the last node of the list and FirstNode is the first one.

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 of how to solve this problem.

Implement your solution in the following coding playground.