LFU Cache Pseudocode and LRU | Dataford Interview Questions

Write pseudo code for an LFU Cache and explain how an LRU Cache works.

Asked in the Round 2 stage.

For the coding portion, implement lfu_cache(capacity, operations). Each operation is ['put', key, value] or ['get', key]. Return an array containing the result of each get, using -1 for a missing key. When full, evict the least frequently used key; break frequency ties by evicting the least recently used key.

Constraints

0 <= capacity <= 10^5
1 <= len(operations) <= 10^5
Each operation is either ['get', key] or ['put', key, value]
Keys and values are integers
A get operation returns the current value or -1 if the key is absent
For equal frequencies, evict the least recently used key

Function Signature

def lfu_cache(capacity, operations):

Your question is LFU Cache Pseudocode and LRU. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write pseudo code for an LFU Cache and explain how an LRU Cache works.

Asked in the Round 2 stage.

Constraints

0 <= capacity <= 10^5
1 <= len(operations) <= 10^5
Each operation is either ['get', key] or ['put', key, value]
Keys and values are integers
A get operation returns the current value or -1 if the key is absent
For equal frequencies, evict the least recently used key

Function Signature

def lfu_cache(capacity, operations):

Your question is LFU Cache Pseudocode and LRU. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.