Design a hash table with O(1) operations and O(n) traversal
Filed under Amazon
The question
Design a hash table data structure supporting insert, search, and delete operations in O(1) time complexity, and a traversal operation that runs in O(n) where n is the number of elements inserted.
No write-up yet. Related questions below have one.
Related Amazon questions
Collected from public candidate posts and coding forums. Updated Nov 2026.