Leetcode 364. Nested List Weight Sum II

Given a nested list of integers, compute the sum where each integer is weighted by the reverse of its depth (elements deeper in the nesting get smaller weights, weight = maxDepth − depth + 1). The challenge is handling arbitrary nesting and determining appropriate weights across levels to produce the weighted total.