Search for a Value in Linked List in DSA C - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to start traversing the linked list from the head node.

DSA C

struct Node* current = [1];

Drag options to blanks, or click blank then click option'

Anext

Btail

CNULL

Dhead

Attempts:

3 left

💡 Hint

Common Mistakes

Using tail instead of head to start traversal.

Assigning NULL which means no node.

Using next pointer without a current node.

The traversal of a linked list starts from the head node, so we assign the head pointer to the current pointer.

2fill in blank

medium

Complete the condition to continue traversing until the end of the linked list.

DSA C

while (current [1] NULL) {
    // process current node
    current = current->next;
}

Drag options to blanks, or click blank then click option'

A!=

B==

C<

D>

Attempts:

3 left

💡 Hint

Common Mistakes

Using '==' which stops immediately if current is not NULL.

Using '<' or '>' which are not valid for pointers.

The loop should continue as long as current is not NULL, meaning there are nodes left to visit.

3fill in blank

hard

Fix the error in the condition to check if the current node's data matches the target value.

DSA C

if (current->data [1] target) {
    return 1; // found
}

Drag options to blanks, or click blank then click option'

A<=

B==

C!=

D=

Attempts:

3 left

💡 Hint

Common Mistakes

Using '=' instead of '==' causes assignment, not comparison.

Using '!=' checks for inequality, which is wrong here.

Use '==' to compare values for equality in C. '=' is assignment, which is incorrect here.

4fill in blank

hard

Fill both blanks to complete the search function that returns 1 if found, 0 otherwise.

DSA C

struct Node* current = head;
while (current [1] NULL) {
    if (current->data [2] target) {
        return 1;
    }
    current = current->next;
}
return 0;

Drag options to blanks, or click blank then click option'

A!=

B==

Attempts:

3 left

💡 Hint

Common Mistakes

Using '==' in the loop condition which stops immediately.

Using '!=' in the if condition which checks for inequality.

The loop continues while current is not NULL, and inside the loop, we check if current->data equals the target.

5fill in blank

hard

Fill all three blanks to create a function that searches for a value in a linked list and returns 1 if found, else 0.

DSA C

int search(struct Node* head, int target) {
    struct Node* current = [1];
    while (current [2] NULL) {
        if (current->data [3] target) {
            return 1;
        }
        current = current->next;
    }
    return 0;
}

Drag options to blanks, or click blank then click option'

Ahead

B!=

C==

DNULL

Attempts:

3 left

💡 Hint

Common Mistakes

Starting from NULL instead of head.

Using '=' instead of '==' for comparison.

Loop condition using '==' instead of '!='.

The function starts from head, loops while current is not NULL, and checks if current->data equals the target.