JavaScript

CHALLENGE

const numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];

const result = numbers
  .filter(n => n % 2 === 0)
  .map(n => n * 2)
  .reduce((acc, curr, idx, arr) => {
    if (idx === arr.length - 1) {
      return (acc + curr) / arr.length;
    }
    return acc + curr;
  }, 0);

console.log(result);

❤2🔥2🤔2

www.tgoop.com/javascript/2443

3.39K viewsJul 2 at 06:33

CHALLENGE

const numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];

const result = numbers
  .filter(n => n % 2 === 0)
  .map(n => n * 2)
  .reduce((acc, curr, idx, arr) => {
    if (idx === arr.length - 1) {
      return (acc + curr) / arr.length;
    }
    return acc + curr;
  }, 0);

console.log(result);

BY JavaScript