Get a free weekly practice problem!

Keep that axe sharp.

× No thanks

You only have free questions left (including this one).

But it doesn't have to end here! Sign up for the 7-day coding interview crash course and you'll get a free Interview Cake problem every week.

Delete a node from a singly-linked list, given only a variable pointing to that node.

The input could, for example, be the variable b below:

public class LinkedListNode { public int value; public LinkedListNode next; public LinkedListNode(int value) { this.value = value; } } LinkedListNode a = new LinkedListNode(1); LinkedListNode b = new LinkedListNode(2); LinkedListNode c = new LinkedListNode(3); a.next = b; b.next = c; deleteNode(b);

We can do this in time and space! But our answer is tricky, and it could have some side effects...

Start your free trial!

Log in or sign up with one click to get immediate access to free mock interview questions

Start your free trial!

Log in or sign up with one click to get immediate access to free mock interview questions

time and space.

Start your free trial!

Log in or sign up with one click to get immediate access to free mock interview questions

Reset editor

Powered by qualified.io

. . .