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.
def removeDuplicates(llist):
current=llist
while current:
if current.next and current.data == current.next.data:
current.next = current.next.next
else:
current = current.next
return llist
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
Delete duplicate-value nodes from a sorted linked list
You are viewing a single comment's thread. Return to all comments →
def removeDuplicates(llist): current=llist while current: if current.next and current.data == current.next.data: current.next = current.next.next else: current = current.next