The range values have been tweaked and properly stated in the description

1. The first code was failing the number 144, which was resolved afterwords;
2. The function pFac is the possible bottleneck for TLE: if it will encounter the number x with big prime divisor (or being the big prime itself), it'll go from 1 to x at worst. Considering the army on some random tests would have several such primes, your solution will check each of them, spending a lot of time and thus timeouting. Maybe there's another way to check if the number is an Achilles one?

(also marked the second one as spoiler)

the series of questions was kept unresolved despite being properly addressed and resolved on the issue above, resolving them now~

Based on the current tests, the max array length may be infinite since the code will keep trying generating the numebr until it finds out the Achilles number (which can take a while in the worst case) :/

Also the special cases may include numbers up to 10^10 (1+Math.random()*10|0 will give you 10 for random giving >0.9 BOTH for power and base)... so yeah, the ranges should definitely be stated.

Add simple range check test in "Sample Tests". It will be useful.

Simple, interesting, useful. Thank you for this kata!

Hint:

1. Open your local terminal and write any simple function. Try to console.log it, see what you get.
2. Then think about Type Conversions.

great feeling! on to the next challenge! go go go!

I feel like on top of the world after sorting this 8kyu kata :-)

Hilarious one. Liked it :D

I feel so stupid. :)

lol. hard one.

You don't need to. The main problem of this task is that it gives us no clue. That's why it sucks.

Well, how can I help you guys who are still struggling?

The answer have no sence at all. It's almost literally like 'qwewqsdad' (don't try to type it in).

So your current task is to find the right way to see what inside this box is. You may ask me 'How the f### you want us to do it?'.

Answer: find a way to get a letter representation of this function ;)