Reverse a linked list

Question

Sigiloso · Accepted Answer

reverse without recursion:

Node*reverse(Node *root){
   Node* prev=NULL,*current=root;
   while(current){
      tmp = current->next;
      current->next = prev;
      prev = current;
      current = tmp;
  }
}

Sigiloso · Answer

Node * reverse( Node * ptr , Node * previous)
{
    Node * temp;
    if(ptr->next == NULL) {
        ptr->next = previous;
        return ptr;
    } else {
        temp = reverse(ptr->next, ptr);
        ptr->next = previous;
        return temp;
    }
}

Sigiloso · Answer

Maintain two/three pointer , pointer to the remaning list while one is being reversed, and then loop till the end

Amazon

Pergunta de entrevista da empresa Amazon

Respostas da entrevista

Empresas seguidas

Buscas de vagas