LinkedHashSet - insertion order and duplicates - keep newest "on top"
<p>I need a collection that keeps insertion order and has unique values. LinkedHashSet looks like the way to go, but there's one problem - when two items are equal, it removes the newest one (which makes sense), here's an example:</p>

<pre><code>set.add("one");
set.add("two");
set.add("three");
set.add("two");
</code></pre>

<p>The <code>LinkedHashSet</code> will print: </p>

<blockquote>
  <p><code>one</code>, <code>two</code>, <code>three</code> </p>
</blockquote>

<p>But what I need is: </p>

<blockquote>
  <p><strong><code>one</code>, <code>three</code>, <code>two</code></strong></p>
</blockquote>

<p>What would be the best solution here? Is there any collection/collections method that can do this or should I implement it manually?</p>