Practice Challenge

Hard Circular Linked List PRO

🔒 Login to Unlock

Problem Statement

Write a C program to check whether a singly linked list has been correctly formed as a circular linked list (returning 1 if circular, 0 otherwise).

Input Format

First line contains n. Second line contains n elements. Third line contains a flag (1 to form circular list, 0 to leave linear).

Output Format

Print 1 if circular, else 0.

Constraints

1 <= n <= 50

Sample Input

4
1 2 3 4
1

Sample Output

Explanation

Use Floyd's cycle-finding algorithm or verify if traversing reaches the starting head node cleanly without hitting NULL.

Starter Code

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

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

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

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock