How should I practice Parse and Sum a Depth-Weighted Nested List?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Parse and Sum a Depth-Weighted Nested List associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · String

Parse and Sum a Depth-Weighted Nested List

● Medium

GoogleFULLTIMEONSITE INTERVIEW

See Google hiring insights

Problem statement

You are given a valid bracketed string nestedList representing a nested list of signed integers. Lists use square brackets, elements are comma-separated, and optional spaces may appear anywhere outside an integer token.

The outermost list has depth 1. Each nested list increases the depth of its integer elements by one. Return the sum of every integer multiplied by its depth.

The problem statement continues

Pro

Examples

Example 1

nestedList = "[3, 8, [2, 14], [2, [91]]]"return = 320

The weighted sum is 3 + 8 + 2*2 + 14*2 + 2*2 + 91*3 = 320.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week