How does functools.reduce fold a sequence?

Q: How does functools.reduce fold a sequence?

**Target Audience:** Developers meeting `reduce` for the first time, or coming from JavaScript `Array.prototype.reduce` or functional languages; candidates expected to trace a fold by hand. **Difficulty:** Medium **Python version:** Behaviour checked on CPython 3.11.17 and in the page runner (Pyodide 0.25.1, CPython 3.11.3); the keyword-argument check was also run on 3.12.3 and 3.13.16. > **How to read this doc:** Each idea is explained in plain words first, then tagged with `📌 Interview term:` — that is the exact vocabulary an interviewer expects to hear. Every output shown was printed by a real run; the **Verified** section quotes it word for word. ## 1. Why This Even Matters — A Story First You are folding a long paper map. You take the first panel, fold the second onto it, then fold the third onto the stack you already have, and so on. At every step you are holding *one* thing — the folded stack so far — and adding the next panel to it. At the end you hold a single small square

The problem

Question presented to candidate: "What does functools.reduce do, step by step? What happens with an empty list, and when would you choose it over a loop or a built-in like sum?"

What a strong answer should cover:

reduce(f, iterable[, initial]) is a left fold: it keeps an accumulator and calls acc = f(acc, item) for each item, returning the final accumulator — reduce(f, [a, b, c]) is f(f(a, b), c).
Without initial, the first item is the starting accumulator (so f runs n-1 times); with initial, f runs n times and initial also fixes the result type.
Edge cases: an empty iterable with no initializer raises TypeError; a single item is returned without calling f; initial is positional only (a keyword raises TypeError on 3.11-3.13).
Left fold means order matters for non-associative operations (reduce(sub, [1, 2, 3, 4]) is -8); a right fold needs reversed and a flipped function.
When to use it: composing functions, walking nested keys, merging or intersecting many collections. Prefer sum, math.prod, max, all, any, "".join or a plain loop when they fit — clearer and faster. It moved out of the built-ins into functools in Python 3.

Code / implementation expected: Optional — trace a small fold, or implement reduce with a loop.

functools
reduce

Try it yourself

Sketch your approach before you read the solution. That is what the interview tests.

Stuck? Get a hint.

A short nudge toward the approach. It will not give the answer away.

Solution

Target Audience: Developers meeting reduce for the first time, or coming from JavaScript Array.prototype.reduce or functional languages; candidates expected to trace a fold by hand. Difficulty: Medium Python version: Behaviour checked on CPython 3.11.17 and in the page runner (Pyodide 0.25.1, CPython 3.11.3); the keyword-argument check was also run on 3.12.3 and 3.13.16.

How to read this doc: Each idea is explained in plain words first, then tagged with 📌 Interview term: — that is the exact vocabulary an interviewer expects to hear. Every output shown was printed by a real run; the Verified section quotes it word for word.

1. Why This Even Matters — A Story First

You are folding a long paper map. You take the first panel, fold the second onto it, then fold the third onto the stack you already have, and so on. At every step you are holding one thing —

The solution is hidden so you can try first

12 min read · 12 sections

Run the code

Edit the code and run it here. Each console line with an expected value becomes a test.

PythonTrace the fold: initializer, left fold, edge cases and a hand-written reduce