Search for a Value in Linked List in DSA Go - Time & Space Complexity

Time Complexity: Search for a Value in Linked List

O(n)

Understanding Time Complexity

When searching for a value in a linked list, we want to know how long it takes as the list grows.

We ask: How does the time to find a value change when the list gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

func Search(head *Node, target int) bool {
    current := head
    for current != nil {
        if current.value == target {
            return true
        }
        current = current.next
    }
    return false
}
    

This code looks through each node in the linked list to find if the target value exists.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Checking each node's value one by one.
• How many times: Up to once per node, until the target is found or list ends.

How Execution Grows With Input

As the list gets longer, the search takes longer because it may check more nodes.

Input Size (n)	Approx. Operations
10	Up to 10 checks
100	Up to 100 checks
1000	Up to 1000 checks

Pattern observation: The number of checks grows directly with the list size.

Final Time Complexity

Time Complexity: O(n)

This means the time to search grows linearly with the number of nodes in the list.

Common Mistake

[X] Wrong: "Searching a linked list is always fast because you just follow the links."

[OK] Correct: You may need to check every node, so time grows with list size, making it slower for long lists.

Interview Connect

Understanding this helps you explain how linked lists work and why searching them takes time proportional to their length.

Self-Check

"What if the linked list was sorted? How would that change the time complexity of searching?"

Practice

1. What is the main purpose of searching for a value in a linked list?

easy

A. To reverse the order of nodes in the list

B. To add a new node at the end of the list

C. To delete the first node of the list

D. To find if a specific value exists in the list

Solution

1. Step 1: Understand the search operation

   Searching means checking each node to see if it contains the target value.

2. Step 2: Identify the goal of searching

   The goal is to find whether the value exists anywhere in the linked list.

3. Final Answer:

   To find if a specific value exists in the list -> Option D

4. Quick Check:

   Search means find value presence = To find if a specific value exists in the list [OK]

Hint: Search means look for a value in nodes [OK]

Common Mistakes:

• Confusing search with insertion or deletion
• Thinking search changes the list structure
• Assuming search reverses the list

2. Which of the following Go code snippets correctly checks if a linked list node's value equals the target value val?

easy

A. if current.val = val { return true }

B. if current.value == val { return true }

C. if current.value := val { return true }

D. if current.value != val { return true }

Solution

1. Step 1: Identify correct equality check syntax in Go

   Use double equals (==) to compare values, not single equals (=) or :=.

2. Step 2: Check the field name and comparison logic

   Assuming node field is 'value', 'current.value == val' correctly compares values.

3. Final Answer:

   if current.value == val { return true } -> Option B

4. Quick Check:

   Use '==' for comparison in Go [OK]

Hint: Use '==' to compare values, not '=' or ':=' [OK]

Common Mistakes:

• Using '=' instead of '==' for comparison
• Using ':=' inside if condition incorrectly
• Checking inequality instead of equality

3. What will be the output of the following Go code that searches for value 5 in a linked list?

type Node struct {
    value int
    next  *Node
}

func search(head *Node, val int) bool {
    current := head
    for current != nil {
        if current.value == val {
            return true
        }
        current = current.next
    }
    return false
}

// List: 1 -> 3 -> 5 -> 7 -> nil
head := &Node{1, &Node{3, &Node{5, &Node{7, nil}}}}
fmt.Println(search(head, 5))

medium

A. true

B. false

C. Compilation error

D. Runtime panic

Solution

1. Step 1: Trace the search function through the list

   It checks nodes 1, 3, then 5. When it finds 5, it returns true immediately.

2. Step 2: Confirm no errors occur

   Code is correct and will print true because 5 exists in the list.

3. Final Answer:

   true -> Option A

4. Quick Check:

   Value 5 found in list = true [OK]

Hint: Stop search when value found, else false [OK]

Common Mistakes:

• Assuming search returns false if value is in list
• Thinking code causes panic due to nil pointer
• Confusing output with string instead of boolean

4. Identify the bug in this Go function that searches for a value in a linked list:

func search(head *Node, val int) bool {
    current := head
    for current.next != nil {
        if current.value == val {
            return true
        }
        current = current.next
    }
    return false
}

medium

A. Loop condition misses checking the last node

B. Comparison uses '=' instead of '=='

C. Function returns true even if value not found

D. Variable 'current' is not initialized

Solution

1. Step 1: Analyze the loop condition

   The loop runs while current.next != nil, so it stops before last node.

2. Step 2: Understand impact on search

   The last node's value is never checked, so search can miss the value if it's there.

3. Final Answer:

   Loop condition misses checking the last node -> Option A

4. Quick Check:

   Loop must check all nodes including last [OK]

Hint: Use 'current != nil' to check all nodes [OK]

Common Mistakes:

• Using current.next != nil instead of current != nil
• Forgetting to check last node's value
• Misreading loop condition as correct

5. Given a linked list where nodes may contain duplicate values, how would you modify the search function to return the count of occurrences of a target value val instead of just true/false?
Choose the correct approach.

hard

A. Return true immediately when first node.value == val is found

B. Use recursion to return true if any node.value == val

C. Traverse all nodes, increment count when node.value == val, return count

D. Stop traversal when node.value != val is found

Solution

1. Step 1: Understand requirement to count all occurrences

   We must check every node because duplicates can appear anywhere.

2. Step 2: Modify search to count matches

   Traverse all nodes, increase count each time node.value equals val, then return count.

3. Final Answer:

   Traverse all nodes, increment count when node.value == val, return count -> Option C

4. Quick Check:

   Count all matches by full traversal [OK]

Hint: Count matches by checking every node [OK]

Common Mistakes:

• Stopping search after first match
• Returning boolean instead of count
• Ignoring duplicates in list