Medium Article Snippet

fp_approach_2.js

/**
  * A slightly different approach that uses different methods to achieve the same result. Just for fun ;) 
  */

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

const fn2 = (inputArr) => {
  return new Array(inputArr.length)
    .fill(null)
    .map(x => [...inputArr]) // if elems in inputArr are not primitive, you will need to deep-copy for the next step
    .map((x, i) => {
       x.splice(i,1); // discard removed value
       return x;
    })
    .map(x => x.reduce((elem, acc) => acc * elem));
}

console.log(fn2(input));

Algorithmic Complexity:

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

Alternative Approach: https://gist.github.com/naveedn/ede7ccf065a354fc8b0a47e50ef37ab7