Flatten nested list

Recursive generator depth-first.

recursion generators

Implement `flatten(nested)` as a generator.

Yield each int in depth-first left-to-right order.

Constraints

Every leaf is int; inner nodes are list.

Example

>>> list(flatten([1, [2, [3, 4], 5]]))
[1, 2, 3, 4, 5]

25 points ~22 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

isinstance(item, list) → yield from flatten(item); else yield item.

Test Results

Press Ctrl+Enter or click Run Tests to execute your code.