We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Linked Lists
  4. Reverse a linked list
  5. Discussions

Reverse a linked list

Sort by

recency

|

894 Discussions

|

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch video explanation here : https://youtu.be/F4nGusqPIu0

    SinglyLinkedListNode* reverse(SinglyLinkedListNode* llist) {
    SinglyLinkedListNode* reverse = nullptr;
    while(llist != nullptr){
        SinglyLinkedListNode* newNode = new SinglyLinkedListNode(llist->data);
        newNode ->next = reverse;
        reverse = newNode;
        llist = llist->next;
    }
    return reverse;
}

  • lordwinjoseph777
     + 0 comments

    SinglyLinkedListNode* reverse(SinglyLinkedListNode* llist) { SinglyLinkedListNode* prev = NULL; SinglyLinkedListNode* current = llist; SinglyLinkedListNode* next = NULL; while (current != NULL) { next = current->next; current->next = prev; prev = current; current = next; } return prev;

    }

  • lordwinjoseph777
     + 0 comments

    SinglyLinkedListNode* reverse(SinglyLinkedListNode* llist) { SinglyLinkedListNode* prev = NULL; SinglyLinkedListNode* current = llist; SinglyLinkedListNode* next = NULL;

    while (current != NULL) {
    next = current->next;
    current->next = prev;
    prev = current;
    current = next;
}
return prev;

    }

  • CS_2212256_T
     + 0 comments
    def reverse(llist):
    reverse, stack, current = SinglyLinkedList(), [], llist
    while current:
        stack.append(current.data)
        current = current.next
    while stack:
        reverse.insert_node(stack.pop())
    return reverse.head

  • deekshachauhan21
     + 0 comments

    Easiest Solution with c#

    just remove the Class and public The final solution is:

    static SinglyLinkedListNode reverse(SinglyLinkedListNode llist)
    {
    SinglyLinkedListNode curr = llist;
    SinglyLinkedListNode prev = null;
    SinglyLinkedListNode next = null;
    
    while(curr!= null)
    {
        next = curr.next; //firstly initialising next to its exact location
        curr.next = prev;//reversing the link
        prev=curr; //will move prev by +1

        curr = next;//will move curr by +1  
}
return prev;
}