⭐ Goal and Objectives

Goal: To design and implement a thread-safe Least Recently Used (LRU) cache data structure in Go that provides $O(1)$ average time complexity for both the Get (read) and Put (write) operations.

Success Criteria:

1. The cache must correctly enforce the capacity limit, evicting the least recently used item when full.
2. Read/Write operations (Get/Put) must operate in constant time $O(1)$.
3. The structure must be thread-safe, preventing race conditions in concurrent use.