Compute a Depth-Weighted Sum of a Nested List
Company: Google
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Compute the depth-weighted sum of integers in an unevenly nested list. Compare recursive and iterative traversals while handling empty lists, negative values, and nesting deep enough to risk stack overflow.
Read the full Google Software Engineer interview experience this question came from