Linked ListMedium

6. Delete from End

Traverses to second-to-last node and updates its next pointer to None, dropping the tail.

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

GoogleAmazonNetflix

Reference implementation (Python)

def delete_end(head):
    if not head or not head.next:
        return None
    curr = head
    while curr.next.next:
        curr = curr.next
    curr.next = None
    return head

Embed this visualization

Drop a live, looping 6. Delete from End canvas into a blog post or course page.

<iframe src="/embed/ll-delete-end" 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 6. Delete from End?

6. Delete from End runs in O(n) time and O(1) auxiliary space.

Is the 6. Delete from End 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 6. Delete from End in interviews?

6. Delete from End shows up in interviews at Google, Amazon, Netflix.

How does the 3D visualization of 6. Delete from End 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.