Round 1
Questions:
You are given a circular doubly linked list that has value, node and prev.
Circular so at some point the list will point back to the front.
Sort the doubly linked list and return the head (the smallest).
Example:
3 <-> 1 <-> 2 <-> 4 <-> 3
Output:
1 <-> 2 <-> 3 <-> 4 <-> 1
Follow-up Question
Specific question not provided.
Candidate's Approach
I couldn't finish this in the 40 mins so I didn't get a second question. I tried to do quicksort but I think next time I would have just done heapsort or something to get a solution down.
Interviewer's Feedback
No feedback provided.