We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Implementation
  4. Extra Long Factorials
  5. Discussions

Extra Long Factorials

  • jorgeh_work + 2 comments

    On the hackerrank's Environment page mentions that HR supports bignumber.js library for javascript. You have to add a require statement for using it. bn = require('bignumber.js');

    https://www.hackerrank.com/environment/languages

    • vernonquan + 0 comments

      ^ This

      Here's my iterative solution using bignumber.js

      const bigFactorial = n => {
  const bigNumber = require('bignumber.js');
  let result = new bigNumber(1);
  for (let i = 1; i <= n; i++) {
    result = result.mul(i);
  }
  return result.toFixed();
}
console.log(bigFactorial(n));
    • adamxtokyo + 0 comments

      ^ This info should be given in the problem description imo.

      I'm surprised at how bad the problem descriptions are here sometimes. I've failed tests so many times because the description was unclear or didn't mention certain restrictions etc. Also, why aren't all tests free to see? (ノಠ益ಠ)ノ彡┻━┻

      Sorry, I digress... Rant over.

      Here's my oneliner solution to the problem in JavaScript (using recursion):

      const BigNumber = require('bignumber.js')

const extraLongFactorials = (n, f = new BigNumber(1)) => n === 1 ? console.log(f.toFixed()) : extraLongFactorials(n - 1, f.times(n))