Given a nested list nestedList of NestedInteger elements, compute the weighted sum of all integers contained in it.

Each integer contributes its value multiplied by its depth, where the depth of an integer is the number of lists from the outermost list down to the integer. The outermost level has depth $1$.

Return the total weighted sum.

Constraints:

• $1 \leq$ nestedList.length $\leq 50$

• Each integer value in nestedList is in the range $[-100, 100]$

• The maximum depth of any integer is $\leq 50$

Input: nestedList = [[1,1], 2, [1,1]]
Output: 10
Explanation: The integers 1 inside the inner lists are at depth 2, and 2 is at depth 1.
Weighted sum = (1+1)*2 + 2*1 + (1+1)*2 = 4 + 2 + 4 = 10.

Input: nestedList = [1, [4, [6]]]
Output: 27
Explanation: Depths: 1 at depth 1, 4 at depth 2, 6 at depth 3.
Weighted sum = 1*1 + 4*2 + 6*3 = 1 + 8 + 18 = 27.

Input: nestedList = [[-1], [-2, [-3]]]
Output: -14
Explanation: Depths: -1 at depth 2, -2 at depth 2, -3 at depth 3.
Weighted sum = (-1)*2 + (-2)*2 + (-3)*3 = -2 - 4 - 9 = -15.

Input: nestedList = [[], [3], [[[]]], 2]
Output: 8
Explanation: Empty lists contribute nothing. 3 is inside one nested list → depth 2, and 2 is at the outermost level → depth 1.
Weighted sum = 3*2 + 2*1 = 6 + 2 = 8.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.