added to JS there, so only missing in Haskell

done

done

Approved

This solution have a problem with n1 = n^x and n2 = m^y

these types of questions convinced me to start learning number theory, mind if you tell me specifically whats this about?

me too)))

Testing for 955
Log
955
Should work for random inputs too - 

Expected: 

'[\'12:42:43\', \'01:48:10\', \'02:53:38\', \'03:59:05\', \'05:04:32\', \'06:10:00\', \'07:15:27\', \'08:20:54\', \'09:26:21\', \'10:31:49\', \'11:37:16\']'

instead got:

'[\'12:42:43\', \'01:48:10\', \'02:53:38\', \'03:59:05\', \'05:04:32\', \'06:09:59\', \'07:15:27\', \'08:20:54\', \'09:26:21\', \'10:31:49\', \'11:37:16\']'

Wow, I used number theory in my solution, but it wasn't anywhere near this compact

No, it is fast.

The tests will only generate a list, also it is likely you see less test cases because the runner will not display the rest (i.e, halt operation) upon an assertion failure is detected.

There are 2 logical errors in your code:

• The largest number starts from rank 1, followed by 2nd largest number etc... , but your code assigns the smallest number as rank 1.

• Also, your code does not handle multi-way ties as it only checks the unique positioning of arrays instead of all elements' positioning

#11bfr_42x

your solution is very elegant . thanks for the intel .
python is a black art .

I know it but i dont know the third argument

What a amazing standard library! (but it maybe slow)