Nested List Weight Sum II: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Flatten Nested List Iterator
Coding · Depth-First Search · Design · Iterator
Accounts Merge
Coding · Array · Breadth-First Search · Depth-First Search
Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search
All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 2 records

LinkedIn
Leetcode 364. Nested List Weight Sum II
Reported Oct 23, 2026 · 32 source reports
JUNIOR, MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source
Meta
Leetcode 364. Nested List Weight Sum II
Reported Aug 1, 2025 · 1 source report
MANAGER
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 3 records

LinkedIn
Nested List Weight Sum II
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source
LinkedIn
Nested List Weight Sum II

Available question text

Nested List Weight Sum II

Available question text

Related questions

Nested List Weight Sum II

Available question text

Related questions