기술 면접에서의 파이썬 사전 동작에 대한 완전한 가이드

Dictionary ordering, key hashing, view objects, and the iteration traps that catch experienced developers.

Dictionaries are the most used Python data structure in production code and one of the most tested in technical interviews. Most developers use them comfortably but have gaps in their understanding of how they actually work.

Insertion Order Is Guaranteed in Python 3.7

data = {}
data["c"] = 3
data["a"] = 1
data["b"] = 2

print(list(data.keys()))
print(list(data.values()))

Enter fullscreen mode Exit fullscreen mode

Output:

['c', 'a', 'b']
['3', '1', '2']

Enter fullscreen mode Exit fullscreen mode

Since Python 3.7, dictionaries maintain insertion order as a language guarantee. Before that, order was an implementation detail. This is worth knowing because interview questions sometimes try to catch candidates who believe dictionaries are unordered.

Mutating a Dictionary While Iterating

data = {"a": 1, "b": 2, "c": 3}

for key in data:
    if data[key] == 2:
        del data[key]

Enter fullscreen mode Exit fullscreen mode

Output: RuntimeError: dictionary changed size during iteration

You cannot add or remove keys from a dictionary while iterating over it. The safe pattern is to iterate over a copy of the keys:

for key in list(data.keys()):
    if data[key] == 2:
        del data[key]

Enter fullscreen mode Exit fullscreen mode

Or collect keys to delete first:

to_delete = [k for k, v in data.items() if v == 2]
for key in to_delete:
    del data[key]

Enter fullscreen mode Exit fullscreen mode

Dictionary Views

data = {"a": 1, "b": 2, "c": 3}
keys = data.keys()
values = data.values()
items = data.items()

print(keys)

data["d"] = 4

print(keys)

Enter fullscreen mode Exit fullscreen mode

Output:

dict_keys(['a', 'b', 'c'])
dict_keys(['a', 'b', 'c', 'd'])

Enter fullscreen mode Exit fullscreen mode

Dictionary views are live views of the dictionary. They update automatically when the dictionary changes. This surprises developers who expect .keys() to return a static snapshot.

The get() Method Versus Direct Access

data = {"a": 1, "b": 2}

print(data["a"])
print(data.get("a"))
print(data.get("z"))
print(data.get("z", 0))

try:
    print(data["z"])
except KeyError as e:
    print(f"KeyError: {e}")

Enter fullscreen mode Exit fullscreen mode

Output:

1
1
None
0
KeyError: 'z'

Enter fullscreen mode Exit fullscreen mode

data["z"] raises KeyError for missing keys. data.get("z") returns None. data.get("z", 0) returns the default value 0. In interview questions about handling missing keys, knowing all three patterns and when each is appropriate demonstrates practical experience.

Dictionary Comprehension Interview Problems

Problem 1:

data = {"a": 1, "b": 2, "c": 3, "d": 4}
result = {k: v for k, v in data.items() if v % 2 == 0}
print(result)

Enter fullscreen mode Exit fullscreen mode

Output: {'b': 2, 'd': 4}

Problem 2:

keys = ["name", "age", "city"]
values = ["Alice", 30, "London"]
result = dict(zip(keys, values))
print(result)

Enter fullscreen mode Exit fullscreen mode

Output: {'name': 'Alice', 'age': 30, 'city': 'London'}

Problem 3 — The Nested Inversion:

original = {"a": {"x": 1}, "b": {"x": 2}, "c": {"x": 3}}
result = {v["x"]: k for k, v in original.items()}
print(result)

Enter fullscreen mode Exit fullscreen mode

Output: {1: 'a', 2: 'b', 3: 'c'}

The defaultdict Pattern

from collections import defaultdict

groups = defaultdict(list)
data = [("fruit", "apple"), ("vegetable", "carrot"), 
        ("fruit", "banana"), ("vegetable", "broccoli")]

for category, item in data:
    groups[category].append(item)

print(dict(groups))

Enter fullscreen mode Exit fullscreen mode

Output: {'fruit': ['apple', 'banana'], 'vegetable': ['carrot', 'broccoli']}

defaultdict(list) creates a new empty list automatically when accessing a missing key. This avoids the if key not in dict pattern. Interviewers often ask candidates to implement grouping logic and the defaultdict approach signals familiarity with the standard library.

Practice dictionary problems with increasing complexity at pycodeit.com.