Recursive Nested Data Traversal | Dataford Interview Questions

Write a recursive function to traverse a nested data structure and perform a specific aggregation or transformation.

For this task, the structure contains integers, lists, and dictionaries whose values may contain further nested structures. Return the sum of every integer leaf value. Empty lists and dictionaries contribute zero.

Input: One nested structure. Output: An integer sum. Dictionary keys are strings, and all leaves are integers.

Constraints

The input is an integer, list, or dictionary.
Lists may contain integers, lists, or dictionaries.
Dictionary values may contain integers, lists, or dictionaries.
Dictionary keys are strings.
All integer leaves fit within Python's integer range.
The nesting depth is at most 1,000.

Function Signature

def sum_nested_values(data):

Your question is Recursive Nested Data Traversal. 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

Write a recursive function to traverse a nested data structure and perform a specific aggregation or transformation.

Input: One nested structure. Output: An integer sum. Dictionary keys are strings, and all leaves are integers.

Constraints

The input is an integer, list, or dictionary.
Lists may contain integers, lists, or dictionaries.
Dictionary values may contain integers, lists, or dictionaries.
Dictionary keys are strings.
All integer leaves fit within Python's integer range.
The nesting depth is at most 1,000.

Function Signature

def sum_nested_values(data):

Your question is Recursive Nested Data Traversal. 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.