feat: add LRU Cache with BaseCache abstraction (#304)

[MOHD-TAHA-KHAN]

📝 Description

This PR introduces a high-performance LRU (Least Recently Used) Cache implementation. It is designed for educational purposes, showcasing how to combine a Hash Map and a Doubly Linked List to achieve constant time complexity for cache operations.

Resolves #304

🚀 Key Features

• OOP Architecture: Uses an Abstract Base Class (BaseCache) and Inheritance to follow professional software design patterns.
• Efficient Performance: - get(key): O(1)
  • put(key, value): O(1)
• Memory Safety: Automatically evicts the least recently used item when the capacity limit is reached.
• Generic Support: Implemented with TypeScript Generics to support any data types.

🧪 Testing

Includes 5+ unit tests in data_structures/cache/__tests__/LRUCache.test.ts covering:

• Basic storage and retrieval.
• Eviction logic when exceeding capacity.
• Moving accessed items to the "Most Recently Used" position.
• Handling capacity of 1.

📊 Complexity

• Time Complexity: $O(1)$ for all operations.
• Space Complexity: $O(C)$ where $C$ is the capacity of the cache.

---

Self-Review Checklist:

• Code follows project naming conventions.
• No any types used.
• Linting and Formatting passed.