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.
reverse, stack, current = SinglyLinkedList(), [], llist
while current:
stack.append(current.data)
current = current.next
while stack:
reverse.insert_node(stack.pop())
return reverse.head
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Reverse a linked list
You are viewing a single comment's thread. Return to all comments →
reverse, stack, current = SinglyLinkedList(), [], llist while current: stack.append(current.data) current = current.next while stack: reverse.insert_node(stack.pop()) return reverse.head