tech(recursion/product-sum): product-sum

Author: sriramanvellingiri

recursion-product-sum.py

@@ -0,0 +1,11 @@
+# O(n) time | O(d) - where n is the total number of elements in the array,
+# including sub-elements and d is the greatest depth of arrays in the array
+def productSum(array, multiplier=1):
+    # Write your code here.
+	sum = 0
+	for element in array:
+		if type(element) is list:
+			sum += productSum(element, multiplier + 1)
+		else:
+			sum += element
+	return sum * multiplier