Split Circular List

Hard Circular Linked List PRO

🔒 Login to Unlock

Problem Statement

Write a C program to split a circular linked list into two halves and print both halves separately.

Input Format

First line contains n. Second line contains n elements.

Output Format

First line: elements of the first half. Second line: elements of the second half.

Constraints

2 <= n <= 50

Sample Input

5
10 20 30 40 50

Sample Output

10 20 30
40 50

Explanation

Use slow and fast pointers to find the midpoint of the circular list, split it into two circular lists, and print both.

Starter Code

#include <stdio.h>
#include <stdlib.h>

struct Node {
    int data;
    struct Node *next;
};

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here to split circular linked list
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock