code: def remove_dups(head):
      
      hashset = set()
      prev = Node()
      while head:
          if head.val in hashset:
              prev.next = head.next
          else:
              hashset.add(head.val)
              prev = head
          head = head.next
docs: Time Complexity: O(N)
      Space Complexity: O(N)