Reverse a singly linked-list with and without using an auxiliary data structure.

Question

dude · Accepted Answer

public void Reverse()
{
            Link cur = head;
            Link prev = null;
            Link temp = null;

            while (cur != null)
            {
                        temp = cur.next;
                        cur.next = prev;

                        prev = cur;
                        cur = temp;
            }

            tail = head;
            head = prev;
}

andy · Answer

Public void reverse()
{
     Node prevNode = null;
     Node focusNode = head;
     Node nextNode = head.next;

     while (nextNode != null)
     {
          focusNode.next = prevNode;
          prevNode = focusNode;

          focusNode = nextNode;
          nextNode = nextNode.next;
     }
     focusNode.next = prevNode;
     head = focusNode;

Interview Answer · Answer

public void reverse(){

 let currentNode = head;
 let previousNode = null;
    while(currentNode){
        let nextNode = currentNode.next;
        currentNode.next = previousNode;
        previousNode = currentNode;
        currentNode = nextNode;
    }
    
    return previousNode;
}

Microsoft

Domanda di colloquio di Microsoft

Risposte di colloquio

Aziende seguite

Ricerche di lavoro