Product Sum

A corgi smiling happily

Write a function that takes in a “special” array and returns its product sum.

A “special” array is a non-empty array that contains either integers or other “special” arrays. The product sum of a “special” array is the sum of its elements, where “special” arrays inside it are summed themselves and then multiplied by their level of depth.

The depth of a “special” array is how far nested it is. For instance, the depth of [] is 1; the depth of the inner array in [[]] is 2; the depth of the innermost array in [[[]]] is 3.

Therefore, the product sum of [x, y] is x + y; the product sum of [x, [y, z]] is x + 2 (y + z); the product sum of [x, [y, [z]]] is x + 2 (y + 3z).

Sample Input

1array = [5, 2, [7, -1], 3, [6, [-13, 8], 4]]

Sample Output

112 // calculated as: 5 + 2 + 2 * (7 - 1) + 3 + 2 * (6 + 3 * (-13 + 8) + 4)


Hint 1

Try using recursion to solve this problem.

Hint 2

Initialize the product sum of the “special” array to 0. Then, iterate through all of the array’s elements; if you come across a number, add it to the product sum; if you come across another “special” array, recursively call the productSum function on it and add the returned value to the product sum. How will you handle multiplying the product sums at a given level of depth?

Hint 3

Have the productSum function take in a second parameter: the multiplier, initialized to 1. Whenever you recursively call the productSum function, pass in the multiplier incremented by 1.

Optimal Space & Time Complexity

O(n) time | O(d) space - where n is the total number of elements in the array, including sub-elements, and d is the greatest depth of “special” arrays in the array

1// Tip: You can use the Array.isArray function to check whether an item
2// is a list or an integer.
3function productSum(array) {
4 return sumDepth(array, 1)
7function sumDepth(array, depth) {
8 let sum = 0;
9 for (let i = 0; i < array.length; i++) {
10 if (Number.isInteger(array[i])) {
11 sum += array[i];
12 } else {
13 sum += sumDepth(array[i], depth + 1)
14 }
15 }
16 return depth * sum;


Do you have any questions, or simply wish to contact me privately? Don’t hesitate to shoot me a DM on Twitter.

Have a wonderful day.
Abhishek 🙏

Subscribe to my newsletter

Get email from me about my ideas, full-stack development resources, tricks and tips as well as exclusive previews of upcoming articles.

No spam. Just the highest quality ideas you’ll find on the web.