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.
this is my solution
def reverse(llist):
# Write your code here
current=llist
prev_node=None
while current:
current.prev,current.next = current.next,current.prev
prev_node = current
current = current.prev
return prev_node
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a doubly linked list
You are viewing a single comment's thread. Return to all comments →
this is my solution def reverse(llist): # Write your code here current=llist prev_node=None while current: current.prev,current.next = current.next,current.prev prev_node = current current = current.prev