Flatten Nested Dictionary Keys | Dataford Interview Questions

Problem

Given a nested dictionary data, return a new flattened dictionary where each nested key path is joined by .. Leaf values should be preserved as-is. If a value is itself a dictionary, continue flattening it recursively.

Assume keys are strings and values are either dictionaries or terminal values such as integers, strings, booleans, or None. The output should contain one entry for every leaf value in the nested structure.

Constraints

0 <= number of keys in the entire structure <= 10^4
Keys are non-empty strings without .
Values are either dictionaries or terminal scalar values
The nesting depth can be large enough to require recursion or an explicit stack

Your question is Flatten Nested Dictionary Keys. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

0 <= number of keys in the entire structure <= 10^4
Keys are non-empty strings without .
Values are either dictionaries or terminal scalar values
The nesting depth can be large enough to require recursion or an explicit stack

Your question is Flatten Nested Dictionary Keys. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.