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. Print in Reverse
  5. Discussions

Print in Reverse

Sort by

recency

|

992 Discussions

|

  • ms_15091993
     + 0 comments

    Java Solution Using Tail Recursion

    public static void reversePrint(SinglyLinkedListNode llist) {
        SinglyLinkedListNode current = llist;

        if(current != null){
                reversePrint(current.next);
                System.out.println(current.data);
        }
}

    }

  • tongyou1995
     + 0 comments

    Python 3 solution, not the most efficient:

    def reversePrint(llist):
    vals = []
    while llist:
        vals.append(llist.data)
        llist = llist.next
    if vals:    
        reversed_vals = reversed(vals)
    for t in reversed_vals:
        print(t)

  • nelucampean
     + 1 comment

    To the Hackerrank Team!!!! Please fix the C# variants for SingleLinkedList problems!!! Almost all of them give compiler errors. The solutions work (adapted) in java but they won't compile in C# because of the input parsing code. Thank you!

  • mdsanz
     + 0 comments

    My Java solution:

    public static void reversePrint(SinglyLinkedListNode llist) {
        SinglyLinkedListNode reverseList = null;
        SinglyLinkedListNode current = llist;
        
        while (current != null) {
            SinglyLinkedListNode temp = new SinglyLinkedListNode(current.data);
            temp.next = reverseList;
            reverseList = temp;
            current = current.next;
        }
        
        while (reverseList != null) {
            System.out.println(reverseList.data);
            reverseList = reverseList.next;
        }
    }

  • ericopokuantwi31
     + 0 comments

    JavaScript Solution:

    function reversePrint(llist) {
    // Write your code here
    if (llist == null) return;
    let current = llist;
    let stack = [];
    while (current) {
        stack.push(current);
        current = current.next
    }
    while (stack.length > 0) {
        console.log(stack.pop().data);
    }
}