Linked ListMedium

7. Delete by Value

Searches for target node's predecessor and bridges its next pointer directly to target.next.

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

MetaGoogleUber

Reference implementation (Python)

def delete_by_value(head, target_val):
    if not head: return None
    if head.val == target_val: return head.next
    curr = head
    while curr.next and curr.next.val != target_val:
        curr = curr.next
    if curr.next:
        curr.next = curr.next.next
    return head

Embed this visualization

Drop a live, looping 7. Delete by Value canvas into a blog post or course page.

<iframe src="/embed/ll-delete-value" 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 7. Delete by Value?

7. Delete by Value runs in O(n) time and O(1) auxiliary space.

Is the 7. Delete by Value 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 7. Delete by Value in interviews?

7. Delete by Value shows up in interviews at Meta, Google, Uber.

How does the 3D visualization of 7. Delete by Value 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.