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.
I could never think of such a short and neat approach.
here is my bruteForce method:-
static void reversePrint(SinglyLinkedListNode head) {
ArrayList<Integer> pl=new ArrayList();
SinglyLinkedListNode temp=head;
while(temp!=null){
pl.add(temp.data);
temp=temp.next;
}
Collections.reverse(pl);
for(int i:pl){
System.out.println(i);
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Print in Reverse
You are viewing a single comment's thread. Return to all comments →
I could never think of such a short and neat approach. here is my bruteForce method:-
static void reversePrint(SinglyLinkedListNode head) { ArrayList<Integer> pl=new ArrayList(); SinglyLinkedListNode temp=head; while(temp!=null){ pl.add(temp.data); temp=temp.next; } Collections.reverse(pl); for(int i:pl){ System.out.println(i); }