Find Nth Node from End

Medium Singly Linked List: Utility

Solve in Playground →

Problem Statement

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

Input Format

First line contains n. Second line contains n elements. Third line contains k (1-indexed position from end).

Output Format

Print the data value of the target node.

Constraints

1 <= k <= n <= 100

Sample Input

5
10 20 30 40 50
2

Sample Output

Explanation

Use two pointers separated by k steps. When the fast pointer reaches the end, the slow pointer points to the target node.

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 k;
        scanf("%d", &k);
        // Write your code here to find Nth node from end
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →