An LRU (least recently used) Cache implemented using Python
- Data structure used: Doubly linked list with a hash map using dictionary.
- get function: get function takes one argument i.e. key and returns its corresponding value, if key is not in cache, returns -1.
- put function: put function takes two arguments i.e. key and value and places it in the cache.
- Miss Rate: miss rate function can be called at any time during execution to get the rate of misses in the cache.