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:
We can do this in time and space! But our answer is tricky, and it could have some side effects...
It might be tempting to try to traverse the list from the beginning until we encounter the node we want to delete. But in this situation, we don't know where the head of the list is—we only have a reference to the node we want to delete.
But hold on—how do we even delete a node from a linked list in general, when we do have a reference to the first node?
We'd change the previous node's pointer to skip the node we want to delete, so it just points straight to the node after it. So if these were our nodes before deleting a node:
These would be our nodes after our deletion:
So we need a way to skip over the current node and go straight to the next node. But we don't even have access to the previous node!
Other than rerouting the previous node's pointer, is there another way to skip from the previous pointer's value to the next pointer's value?
What if we modify the current node instead of deleting it?
We take data and next from the input node's next node and copy them into the input node. Now the input node's previous node effectively skips the input node's old value!
So for example, if this was our linked list before we called our function:
This would be our list after we called our function:
In C we manually delete the node we copied from, since we won't be using that node anymore. Other languages, like Java or Python, take care of this for us, but C forces us to manage memory allocation ourselves.
But be careful—there are some potential problems with this implementation:
First, it doesn't work for deleting the last node in the list. We could change the node we're deleting to have a value of NULL, but the second-to-last node's next pointer would still point to a node, even though it should be NULL. This could work—we could treat this last, "deleted" node with value NULL as a "dead node" or a "sentinel node," and adjust any node traversing code to stop traversing when it hits such a node. The trade-off there is we couldn't have non-dead nodes with values set to NULL. Instead we chose to abort in this case.
Second, this technique can cause some unexpected side-effects. For example, let's say we call:
There are two potential side-effects:
time and space.
My favorite part of this problem is how imperfect the solution is. Because it modifies the list "in place" it can cause other parts of the surrounding system to break. This is called a "side effect."
In-place operations like this can save time and/or space, but they're risky. If you ever make in-place modifications in an interview, make sure you tell your interviewer that in a real system you'd carefully check for side effects in the rest of the code base.
Powered by qualified.io