Medium Article Snippet

fp_approach.js

const input = [1,3,5,7];

const fn = (inputArr) =>
  inputArr
    .map(x => [...inputArr])
    .map((x, i) => {
      const firstPart = x.slice(0, i);
      const lastPart = x.slice(i+1);

      return [...firstPart, ...lastPart];
    })
    .map(x => x.reduce((elem, acc) => acc * elem));

console.log(fn(input));

Algorithmic Complexity:

Speed: O(n2)
Space: O(n2)

Alternative Approach: https://gist.github.com/naveedn/9ad30d2f9bc6789aea24f1e5156d6934