-
-
Notifications
You must be signed in to change notification settings - Fork 29
Expand file tree
/
Copy pathcalculateSumAndProduct.js
More file actions
37 lines (36 loc) · 1.15 KB
/
calculateSumAndProduct.js
File metadata and controls
37 lines (36 loc) · 1.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/**
* Calculate the sum and product of integers in a list
*
* Note: the "sum" is every number added together
* and the "product" is every number multiplied together
* so for example: [2, 3, 5] would return
* {
* "sum": 10, // 2 + 3 + 5
* "product": 30 // 2 * 3 * 5
* }
*
* Time Complexity: O(n)
* Space Complexity: O(1)
* Optimal Time Complexity: O(n)
* Explanation: The function iterates through the list of numbers twice,
* once to calculate the sum and once to calculate the product.
* Each iteration takes O(n) time, resulting in a total time complexity of O(n).
* The space complexity is O(1) because we are using a constant amount of space to store the sum and product,
* regardless of the size of the input list.
*
* Refactor:
* I combined the two loops into a single loop
* to calculate both the sum and product simultaneously.
*
* @param {Array<number>} numbers - Numbers to process
* @returns {Object} Object containing running total and product
*/
export function calculateSumAndProduct(numbers) {
let sum = 0;
let product = 1;
for (const num of numbers) {
sum += num;
product *= num;
}
return {sum,product};
}