How do you delete a node when you are given only that node, not the head?
PICTURE THIS: HOW TO EXPLAIN IT
Simple meaning
Copy the next node's value into the current node and bypass next by pointing current.next to next.next.
WHY — Linked List instead of guessing?
Why interviewers care about Linked List:
question about Linked List.
trade-offs, and what you would actually do on a DSA project - not buzzwords.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Copy the next node's
value into the current node and bypass next by pointing current.next to next.next.
- 2That is O(1) time
and O(1) space, but it cannot delete the tail and mutates values rather than the original node identity.
- 3How it works
State that limitation clearly.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Copy the next node's value into the current node and bypass next by pointing current.next to next.next. That is O(1) time and O(1) space, but it cannot delete the tail and mutates values rather than the original node identity.