Discussion on: Project Euler Problem 6 Solved with Javascript

View post

Replies for: You say simple, but that looks really complicated to me haha Thanks for sharing! I'm always interested in what the solutions look like in other l...

Maximilian Burszley • Mar 12 '20 • Edited

I mean, JavaScript has similar constructs:

function euler6(n) {
  const sumOfSquares = range(n + 1).map((x) => x ** 2).reduce((a, b) => a + b);
  const squareOfSum = range(n + 1).reduce((a, b) => a + b).map((x) => x ** 2);

  return squareOfSum - sumOfSquares;
}

function range(n) {
  return [...Array(n).keys()];
}

This could be further simplified with generator functions to get the iterator behavior seen in the Rust example.

Jared • Mar 12 '20

Yep, that is definitely one way to do it. I personally prefer more legible code (because I'm a simple human), but this gets the job done.

Thanks for sharing!