Practice Coding Question | Real Coding Interviews | Hack2hire

Product Pricing Blog Forum

Quick Summary

Implement an in-memory key-value store supporting exact CRUD operations.
Enable efficient retrieval of all values whose keys share a common prefix.
Balance constant-time exact lookups with fast prefix-based traversal.

What This Tests

Hash table implementation for O(1) exact key management
Trie construction and traversal for prefix queries
Maintaining synchronization between multiple data structures
Error handling for invalid states like duplicate keys

Common Patterns

HashingTrie

Hint 1

Hint 2

What Interviewers May Ask Next

Report seen similar question in interview

python

Test Cases

Input

Output

Expected