Dict comprehensions use {key: value for ... in iterable}. The most common shape is computing a key from each element and a value from a function of that element, which collapses a five-line for / dict[key] = value loop into one expression. Building from a list of tuples is identical to dict(rows), but the comprehension form is more flexible because it lets you transform the keys and values inline. Time complexity is O(n) for n input elements.

Inverting a dict (swapping keys and values) is a one-liner with {v: k for k, v in d.items()}. This only works when the values are hashable AND unique; duplicate values silently lose data because later writes win. Merging two dicts with {**a, **b} is the modern syntax (Python 3.5+) for b overriding a, useful for layered configs. Renaming keys with an f-string in the comprehension is the canonical way to add a prefix without writing a new function.

An if clause inside the dict comprehension filters which key-value pairs survive, the same way it does for list comprehensions. Combining filtering with transformation produces concise code for common operations like 'keep only passing scores', 'normalise to floats', 'bucket into bands'. Watch out for the same readability ceiling: comprehensions with two transformations and a filter can be fine, but an f-string key plus a chained ternary value plus a filter is usually a sign that a regular for loop or a helper function would read better.