Im a fool ((((

instantly humbled lol

Is the best possible solution, a linear time one. This is a classic, well known problem, for a in depth discussion see Richard Bird, THinking functionally in Haskell.

55555 I'm vegetable

WOW

wow

Add Haskell test framework pls OMO~~

What is the question? Why it fail?
It's not in proper order. The chellange is not only calculate position but also sort it. You can see everything in description and in example.

Basic test, no. 1
Log
[ { name: 'John', points: 100, position: 4 },
{ name: 'Bob', points: 130, position: 1 },
{ name: 'Mary', points: 120, position: 2 },
{ name: 'Kate', points: 120, position: 2 } ]
expected [ Array(4) ] to deeply equal [ Array(4) ]

The challenge is sort by points and calulate position for every person. But remember if two or more persons have same number of points, they should have same position number and sorted by name (name is unique).

edit: or were you actually asking for more fixed tests??

Your solution is using recursion. It looks roughly correct, but will be very slow on large problem instances due to all the copying of data. Maybe you could use a non-recursive implementation of the same algorithm?

1. Why the need to use eval when you can write and execute the code directly?
2. AFAIK regex replace function in JS strings is a pure function; i.e. it does not mutate the string itself. So doing someString.replace(someRegex, someReplacement) without assigning the result to a variable just leaves the original string unchanged.

Best Practices with no doute