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.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 24: More Linked Lists
  5. Discussions

Day 24: More Linked Lists

  • nehuen_esquivel
     + 0 comments

    Here is a general solution because I didn't read the entire specification 🤡

        def removeDuplicates(self,head):
        head_data = head.data
        
        result_head = Node(head_data)         
        previous_result_node = result_head
        
        elements = list()  
        elements.append(head_data)
        
        node = head.next        
        while node is not None:  
            node_data = node.data          
            if node_data not in elements:                
                result_node = Node(node_data)              
                previous_result_node.next = result_node
                previous_result_node = result_node
                               
                elements.append(node_data)
                
            node = node.next
        
        return result_head