Thanks bro.

don't be so discouraged at having only done 15 kata. consider just working on white kyu problems for a while. your skills will build when you feed 'em. good luck!

You can use "i * i <= n + 1" instead of "i <= n;". It removes redundant calculations.

I don't know why people mark this as clever, to me it's clearly best practices as I'd prefer this code over other answers in production because it's clean and small enough to grasp immediately. Though you missed +1 at list generation:

(i) => interval[0] + i // all elements will be smaller than actual ones in the interval by one

which should be as the following:

(i) => interval[0] + 1 + i

But it doesn't really matter, the code works correctly and it's fine.

Map call is not needed as factorials can be calculated inside fold .

genius

Try to format a bit the code. Is a bit hard to read it

Great!...

just curious,would it work for a single array with extreme values??

slow but clearly

Excellent work

Good day! Could you please Review my issue?

https://www.codewars.com/kata/reviews/5fd9dea06aabc20001856979/groups/60f080ffaa8be900019aee7a

Best Regards