Lru Cache

medium

Implement LRU(Least Recently Used Cache), Task is to complete implementations of put(),get().
1. capacity : capacity of the cache will be provided as input.
2. put(key,value) : add the key-value pair to the Cache & override if the pair is already present in cache;
3. get(key) : get the value associated with the key, return "-1" incase key-value pair doesn't exists

NOTE : Watch Question video to get better understanding of problem.
Example  : 
    Input : Start 3
            put 1 10
            put 2 20
            put 3 30
            get 1
            put 1 15
            get 1
            get 2
            put 4 40
            get 3
            get 4
            Stop
            
            
    Output : 10
             15
             20
             -1
             40

Input Format

Output Format is handled for you.

Output Format

Output Format is handled for you.

Constraints

1 &lt;= cap &lt;= 2000
0 &lt;= key &lt;= 100000
0 &lt;= val &lt;= 100000

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

start 3
put 1 10
put 2 20
put 3 30
put 4 40
get 1
stop

Output

-1

First Non-repeating Character

X Of A Kind In A Deck

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String