Split a Circular Linked List
Try to solve the Split a Circular Linked List problem.
We'll cover the following...
Statement
Given a circular linked list, list
, of positive integers, your task is to 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 ...
Access this course and 1400+ top-rated courses and projects.