Microsoft Interview Question

Recursively reverse a singly linked list.

Interview Answers

Anonymous

Nov 19, 2009

Just gave this a shot. void reverse(Node node, Node previous){ Node next = node->next; node->next = previous; //point to previous node if(next != null) { reverse(next, node); } }

Anonymous

Oct 1, 2011

My fav :)

Anonymous

May 25, 2019

Stand up and walk backwards out of the interview room.

Anonymous

Mar 21, 2009

The difficulty was not so much in the question but in the on the spot nature without much time.