Linked ListEasy

8. Search an Element

Traverses sequentially comparing each node's value against the search key until found.

Time O(n) Space O(1)

Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.

Asked in interviews at

Goldman SachsAdobeSalesforce

Reference implementation (Python)

def search_linked_list(head, target):
    curr = head
    index = 0
    while curr:
        if curr.val == target:
            return index
        curr = curr.next
        index += 1
    return -1

Embed this visualization

Drop a live, looping 8. Search an Element canvas into a blog post or course page.

<iframe src="/embed/ll-search" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>

Frequently asked

What is the time and space complexity of 8. Search an Element?

8. Search an Element runs in O(n) time and O(1) auxiliary space.

Is the 8. Search an Element visualizer free?

The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.

Which companies ask 8. Search an Element in interviews?

8. Search an Element shows up in interviews at Goldman Sachs, Adobe, Salesforce.

How does the 3D visualization of 8. Search an Element work?

Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.