Spotify Off Campus Hiring | LFU Cache Problem Using Hashmap and doubly LinkedList

Problem Statement Design and implement a data structure for a Least Frequently Used (LFU) cache. Implement the LFUCache class: LFUCache(int capacity): Initializes the object with the capacity of the data structure. int get(int key): Gets the value of the key if the key exists in the cache. Otherwise, returns -1. void put(int key, int value): Update the value of the key if present, or inserts the key if not already present. When the cache reaches its capacity, it should invalidate ...