Array sum with recursion

Problem

Given an array of integers, find the sum of all elements in the array.
Input:
[1, 2, 3, 4, 5]
Output:
15

Solution

This solution is in JavaScript. Our A.I. can create solutions in multiple languages.

kayakane

// Solution:

// The optimal solution is to use the reduce method on the array.
// The reduce method will iterate through the array and add each element to the accumulator.
// The accumulator is initialized to 0.
// The reduce method will return the sum of all elements in the array.

const sum = (arr) => {
  return arr.reduce((acc, curr) => acc + curr, 0);
};

console.log(sum([1, 2, 3, 4, 5]));