A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Problem

Given a nested dict (leaves are any non-dict values), return a flat list of leaves in depth-first traversal order of the keys. Within a dict level, iterate keys in insertion order.

Summary

The tree has leaves. Pluck them.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.