Watch others solve Linked Lists interview questions, see how they did, and learn from their mistakes.
Get step-by-step instructions on how to approach and solve common technical interview questions.
Given the head of a linked list, reverse the list and return the new head.
Given a linked list with nodes that have an additional pointer referring to another node in the list, return a deep copy of the list.
Given a list of integers L and a number K, write a function that reorganizes L into three partitions: elements less than K, elements equal to K, and elements greater than K. No additional lists may be used.
Interview prep and job hunting are chaos and pain. We can help. Really.