Problem Statement

Problem Description Build a data structure that implements a Least Recently Used (LRU) cache, supporting two operations: get and set. * get(key): Return the value (always positive) stored under key if it exists in the cache, otherwise return -1. * set(key, value): Insert or update the value for key. Once the cache is at full capacity, inserting a new key must first evict whichever item was least recently used. The LRUCache is constructed with an integer giving its capacity, the maximum number of distinct keys it can hold at once. Definition of "least recently used": Any get or set touching an item counts as an access to it. The "least recently used" item is whichever one was accessed longest ago. Note: If you are using any global variables, make sure to clear them in the constructor. Implementation Note: You only need to implement the given function. Do not read input; instead use the arguments to the function. Do not print the output; instead return values as specified. Examples capac