Implement an LRU Cache (HashMap + Doubly Linked List) and Debug an Existing Implementation

Problem: Build and Repair an LRU Cache Create a fixed-size LRU (Least Recently Used) cache that provides the operations below in amortized O(1) time: get(key): When key is present, return its associated value and promote that entry to most recently used; when absent, return -1. put(key, value): Add or replace the value for key, then treat that entry as most recently used. If this causes the cache to grow beyond capacity, discard the least recently used entry. Requirements…