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.
here if you go with prev; and curr then you would get the same answer without loop.
while (curr!==null) {
ahead = curr.next;
curr.next = prev;
prev = curr;
curr = ahead;
}
llist = prev;
return llist;
here
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a linked list
You are viewing a single comment's thread. Return to all comments →
here if you go with prev; and curr then you would get the same answer without loop. while (curr!==null) { ahead = curr.next; curr.next = prev; prev = curr; curr = ahead; }
here