Optimize Data Retrieval | Dataford Interview Questions

Write a function to optimize a data retrieval process.

Given a known sequence of item requests and a fixed-size cache, return the minimum number of backend retrievals needed. You may evict cached items, and a request is a cache hit when its item is already stored.

Implement def optimize_data_retrieval(requests, cache_capacity):, returning an integer. Use the optimal offline eviction strategy: when the cache is full, evict the cached item whose next request occurs farthest in the future, or that is never requested again.

Constraints

0 <= len(requests) <= 100000
0 <= cache_capacity <= len(requests)
Each request is a non-empty hashable item
Return the minimum possible number of backend retrievals

Function Signature

def optimize_data_retrieval(requests, cache_capacity):

Your question is Optimize Data Retrieval. 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 a function to optimize a data retrieval process.

Constraints

0 <= len(requests) <= 100000
0 <= cache_capacity <= len(requests)
Each request is a non-empty hashable item
Return the minimum possible number of backend retrievals

Function Signature

def optimize_data_retrieval(requests, cache_capacity):

Your question is Optimize Data Retrieval. 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.