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:
attr_accessor :value, :next
@value = value
@next = nil
a = LinkedListNode.new('A')
b = LinkedListNode.new('B')
c = LinkedListNode.new('C')
a.next = b
b.next = c
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