Bucket Distinct Integer Keys by Hash | Dataford Interview Questions

Discuss how hashing works in Python (e.g. how dicts/sets hash keys). Asked in the technical phone screen, after an LC easy/medium problem.

Implement bucket_keys(keys, bucket_count). Given a list of hashable integer keys, return a list of bucket_count lists. Place each distinct key in the bucket at index hash(key) % bucket_count, preserving first-seen order within each bucket. Python equality determines whether two keys are duplicates.

Input and Output

keys is a list of integers and bucket_count is a positive integer. Return a list of lists. Empty buckets must be represented by empty lists.

Constraints

0 <= len(keys) <= 10^4
1 <= bucket_count <= 10^3
Keys are integers
Each distinct key appears in only one output bucket

Function Signature

def bucket_keys(keys, bucket_count):

Your question is Bucket Distinct Integer Keys by Hash. 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