Can I filter out duplicates within an array list using hashset in Java without distorting the order of the array?

Question

I was wondering how I could return an array list in Java but filter out any duplicates that come from my object? I've heard the best way to do this is by using a hashset is this true or is there a better implementation? The reason I am skeptical about using hashset is I have heard it distorts the order of the array which is not what I want.

Answer 1

What you are are looking for is a Collection that maintains insertion order and does not allow duplicates.

Thankfully, there is one available in the form of a LinkedHashSet