Depth-Weighted Nested Sum | Dataford Interview Questions

Given a nested list of integers, where each element is either an integer or another nested list, return the sum of all integers multiplied by their depth. The outermost list's elements have depth 1, and each nested list increases the depth by 1. Implement def depth_sum(nested_list):, returning an integer for a list containing integers and arbitrarily nested lists.

Constraints

1 <= the total number of list and integer elements <= 10^4
0 <= nesting depth <= 10^4
-10^9 <= each integer <= 10^9
Each element is either an integer or a list of valid nested elements

Function Signature

def depth_sum(nested_list):

Your question is Depth-Weighted Nested Sum. 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

1 <= the total number of list and integer elements <= 10^4
0 <= nesting depth <= 10^4
-10^9 <= each integer <= 10^9
Each element is either an integer or a list of valid nested elements

Function Signature

def depth_sum(nested_list):

Your question is Depth-Weighted Nested Sum. 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.