Meta interview question
Reverse a singly linked list
Interview Answer
Anonymous
14 Mar 2011
{last = 0, i=start} while (i) {next = i->next, i->next = last; last = i; i=next}
Reverse a singly linked list
Anonymous
{last = 0, i=start} while (i) {next = i->next, i->next = last; last = i; i=next}
Check out your Company Bowl for anonymous work chats.