Python Dictionary Internals | Dataford Interview Questions

How do dictionaries work in Python?

Implement a simplified dictionary using a fixed number of hash buckets and separate chaining. Process set, get, delete, and contains operations, preserving the behavior of Python dictionary lookups for integer keys.

The function receives operations as a list of operation arrays and bucket_count as a positive integer. Return one result for each get or contains operation, using None when get requests a missing key.

Input and Output

set has the shape ["set", key, value]; other operations have the shape [operation, key]. Return a list containing query results in order.

Constraints

1 <= len(operations) <= 10^4
1 <= bucket_count <= 10^3
Keys are integers
Values are integers
Each operation is valid and is one of set, get, delete, or contains

Function Signature

def build_dictionary(operations, bucket_count):

Your question is Python Dictionary Internals. 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