Mark As Completed Discussion

Good evening! Here's our prompt for today.

When preparing for an interview, you should be familiar with fundamental graph traversal techniques because they are frequently used in technical interviews. As we live in an interconnected society with no isolated piece of information, the use of graphs is becoming more widespread. Today's prompt has one such graph traversal technique, Depth first search (DFS).

Prompt

You are given a nested list of integers nestedList. Each element is either an:

  1. integer, or
  2. a list whose elements may also be integers, or other lists

The depth of an integer is the number of lists that it is inside of. For example, the nested list [1,[2,2],[[3],2],1] has each integer's value set to its depth.

Return the sum of rach integer in nestedList by its depth.

Expected Inputs and Outputs

Example 1

SNIPPET
1Input: [[1,1],2,[1,1]]
2Output: 10 

Explanation: Four 1's at depth 2, one 2 at depth 1.

Nested List Weight Sum

Example 2

SNIPPET
1Input: [1,[4,[6]]]
2Output: 27 

Nested List Weight Sum

Explanation: One 1 at depth 1, one 4 at depth 2, and one 6 at depth 3; 1 + 4*2 + 6*3 = 27.

Constraints

  • nestedList.length <= 50
  • The values of the integers in the nested list is in the range [-100, 100].
  • The maximum depth of any integer is less than or equal to 50.

Try to solve this here or in Interactive Mode.

How do I practice this challenge?

JAVASCRIPT
OUTPUT
:001 > Cmd/Ctrl-Enter to run, Cmd/Ctrl-/ to comment

We'll now take you through what you need to know.

How do I use this guide?

Access all course materials today

The rest of this tutorial's contents are only available for premium members. Please explore your options at the link below.

Returning members can login to stop seeing this.