Search Element

Easy Singly Linked List: Searching
Solve in Playground →

Problem Statement

Write a C program to search for a specific element in a singly linked list and print 1 if found, or 0 if not found.

Input Format

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

Output Format

Print 1 if found, else 0.

Constraints

1 <= n <= 100

Sample Input

5
10 20 30 40 50
30

Sample Output

1

Explanation

Traverse through the linked list node by node, comparing each node's data with the target value.

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 search for target
    }
    return 0;
}

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used