โ† Microsoft questions

Nested list weight sum (Graph variant)

Filed under Microsoft

Given a graph-like nested structure where nodes contain either an integer value or a list of child nodes, calculate the sum of all elements weighted by their depth. The root is at depth 1.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.