What data structure should I use to keep track of recently used items?

Question

I need something like a bounded queue where I can only insert say 10 elements. A new element should override the last inserted element. There should be only n distinct elements

I am looking for suggestions in Java by the way.

Answer 1

ITYM an implementation of a LRU algorithm.

• How to set up a simple LRU cache using LinkedHashMap

• Simple LRU Caching with Expiration