Write code to remove duplicates from an unsorted linked list.
How would you solve this problem if a temporary buffer is not allowed?
How to Solve
HashSet, I can control if each value appears or not already. And in case I want to traverse, I can check it by using
next property in LinkedListNode.
In Follow Up case
By using double while loops, I can do the same task like this.