The Frequency Eviction
A hard Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- hard
- Seniority
- L5
Interview Prompt
Implement LFUCache(capacity) with get(key) returning the value (or -1 if missing) and put(key, value). When capacity is exceeded, evict the least-frequently-used entry. Ties are broken by LRU. Test harness passes parallel ['method', args] sequences and expects the list of return values (None for put, value or -1 for get).
Summary
When storage is tight, something has to go.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision