There is a better way for your challenge by combining recursion and memorize
const cache = {}; const fac = (num) => { if (num ==0) return 1; if (cache[String(num)]) { return cache[String(num)] } const result = fac(num)*fac(num-1); cache[String(num)] = result; return result; }
The line const result = fac(num)*fac(num-1); , should be const result = num * fac(num-1); otherwise it will cause a stack overflow.
const result = fac(num)*fac(num-1);
const result = num * fac(num-1);
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
There is a better way for your challenge by combining recursion and memorize
The line
const result = fac(num)*fac(num-1);
, should beconst result = num * fac(num-1);
otherwise it will cause a stack overflow.