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

|

983 Discussions

|

  • dvkstalin
     + 0 comments

    Kotlin:

    fun reversePrint(llist: SinglyLinkedListNode?): Unit {
    val list=ArrayList<Int>()
    var current=llist
    while(current!=null){
        list.add(current.data)
        current=current.next
    }
    list.reverse()
    list.forEach{
        println(it)
    }
}

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the vidéo explanation here : https://youtu.be/WO7Uz7sQML4

    void reversePrint(SinglyLinkedListNode* llist) {
    if(llist == nullptr) return;
    reversePrint(llist->next);
    cout << llist->data << endl;
}

  • braiam_soto3256
     + 0 comments

    This is the perfect way to understand recursive

    public static void reversePrint(SinglyLinkedListNode llist) { if(llist != null){ reversePrint(llist.next); System.out.println(llist.data); } }

  • Lonchik
     + 0 comments

    Third issue with C# template here... hackerrank, what's up with that? You need good C# coders to fix up your templates????

    Solution:

    Same as prior problem

    remove class Result, but keep its guts. change function to be non-public -- remove public keyword.

  • ouadochhassan201
     + 0 comments

    solution with javascript

    function reversePrint(llist) {
    var i =0;
    var arr = []
        let currentNode = llist
        while(currentNode!==null){
            i++;
           currentNode = currentNode.next;
        }
         currentNode = llist;
        for(let j = 0;j<i;j++){
            arr.unshift(currentNode.data);
            currentNode = currentNode.next;
        }
       for(let j=0;j<i;j++){
        console.log(arr[j])
       }
    // Write your code here

}