Find Nth Node

Easy Singly Linked List: Utility

Solve in Playground →

Problem Statement

Write a C program to find and print the data of the Nth node (0-indexed) in a singly linked list.

Input Format

First line contains size. Second line contains elements. Third line contains the 0-based index N.

Output Format

Print the data value at the given index.

Constraints

0 <= index < n <= 100

Sample Input

4
10 20 30 40
2

Sample Output

Explanation

Traverse the list up to the specified index position and print the node's data.

Starter Code

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

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

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        struct Node *head = NULL, *tail = NULL;
        for (int i = 0; i < n; i++) {
            int val;
            scanf("%d", &val);
            struct Node *newNode = (struct Node *)malloc(sizeof(struct Node));
            newNode->data = val;
            newNode->next = NULL;
            if (head == NULL) {
                head = newNode;
                tail = newNode;
            } else {
                tail->next = newNode;
                tail = newNode;
            }
        }
        int index;
        scanf("%d", &index);
        // Write your code here to find Nth node
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →