Reverse a linked list (warm up question).

Question

Sigiloso · Accepted Answer

Node* reverseLL(Node* n) {
   Node* curr = n;
   Node* prev = null;
   while(curr !=null) {
        Node* temp = curr.next;
        curr.next = prev;
        prev = curr;
        curr = temp;
   }
   return prev;
}

Hesh · Answer

This is in PHP
function reverseLinkedListRecursive($current, $second){
  if($second->next == null){
    $second->next = $current;
    return $second;
  }
  else {
    $node = reverseLinkedListRecursive($second, $second->next);
    $second->next = $current;
    return $node;
  }
}

Anup H Nair · Answer

//If additional buffer is allowed then use a Stack. 

1) iterate through the linked-list and add each node values to a stack,
2)iterate again through the linked-list and replace the node values with the values of the stack(starting from top of the stack )using pop operation.

Meta

Pergunta de entrevista da empresa Meta

Respostas da entrevista

Empresas seguidas

Buscas de vagas