Explain Complexity and Design | Dataford Interview Questions

Then asked me questions about complexity and why I designed it that way.

Implement count_cache_misses(requests, capacity) for a least recently used cache. Return the number of requests that are not currently cached. A cache hit refreshes that request's recency; a miss inserts it, and inserting beyond capacity evicts the least recently used request.

Input/output: requests is a list of integers, capacity is a positive integer, and the function returns an integer miss count.

Constraints

0 <= requests.length <= 10^4
1 <= capacity <= 10^4
Requests contain integers
Return the number of cache misses

Function Signature

def count_cache_misses(requests, capacity):

Your question is Explain Complexity and Design. 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

Then asked me questions about complexity and why I designed it that way.

Input/output: requests is a list of integers, capacity is a positive integer, and the function returns an integer miss count.

Constraints

0 <= requests.length <= 10^4
1 <= capacity <= 10^4
Requests contain integers
Return the number of cache misses

Function Signature

def count_cache_misses(requests, capacity):

Your question is Explain Complexity and Design. 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.