Hash Table Operations Tradeoff | Dataford Interview Questions

Build a hash table where getRandom(), put() and get() are O(1) and delete is O(n).

Asked in the phone interview stage. Implement the structure using PostgreSQL tables and functions, then show its final contents after the prescribed operations.

Output

Return one row per remaining entry with columns slot, key, and value.
Include entries after updating account_003 and deleting account_006.
Order by slot ascending.

Schema

hash_table_entries

Column	Type	Description
slotPK	BIGINT	Compact position of the entry
key	VARCHAR(64)	Unique hash-table key
value	VARCHAR(32)	Value associated with the key

Your question is Hash Table Operations Tradeoff. Start with the requirements and the one table 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