Find Last Occurrence

Medium Singly Linked List: Searching

Solve in Playground →

Problem Statement

Write a C program to find the 0-based index of the last occurrence of an element in a singly linked list, or -1 if not found.

Input Format

First line contains n. Second line contains n elements. Third line contains the target value.

Output Format

Print the 0-based index of the last occurrence or -1.

Constraints

1 <= n <= 100

Sample Input

5
10 20 30 20 40
20

Sample Output

Explanation

Traverse the entire list from head to tail while updating a match index tracker every time a matching value is found.

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 target;
        scanf("%d", &target);
        // Write your code here to find last occurrence index
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →