30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

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.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early October, 2025

Senior

Late September, 2025

Senior

364. Nested List Weight Sum II

Mid September, 2025

Senior

Get Premium to View All 7 Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 364. Nested List Weight Sum II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact