Why dict keys must be hashable

Question

Accepted Answer

Python dicts are implemented as hash tables. When you set d[k] = v, Python computes hash(k) to find a slot in the underlying array. This gives O(1) average lookup. If a key were mutable its hash could change after insertion, making it impossible to find again. Immutable types like str, int, and tuple have stable hashes; mutable types like list do not.