I have been busy preparing for upcoming interviews and doubling down on getting algorithm practice in, so let’s get in to the third iteration of the Algorithm Practice series: Product Sum.
Happy 2021! It’s a new year and a fresh start, and we’re diving right back in to mastering algorithms.
I have been busy preparing for upcoming interviews and doubling down on getting algorithm practice in, so this week, let’s get in to the third iteration of the Algorithm Practice series.
This week, we will do a walkthrough of the Product Sum algorithm problem. It is another algorithm that often comes up during technical interviews. Given an array, our task is to write a function that returns its product sum.
Some things to clarify before we get in to thinking about how to tackle the task at hand. The given array (what we’ll call a “special” array) is always a non-empty array containing integers or other nested “special” arrays.
And what do we mean by product sum? The product sum of a “special” array is the sum of its elements, but with a catch — where there are nested “special” arrays, the elements of the nested array is summed up and multiplied by their depth level (how nested the “special” array is).