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.

Thanks!

Thanks.

Thanks

Thank you

1. calculate all products (p) for each removed element (n)
2. sort the resulting array by product (descending), thus, maximum product is at index 0
3. find all other removed elements with the same resulting products
4. sort by removed element (ascending), thus, lowest removed element is at position 0
5. return removed element at position 0

hope that helped :)

p.s.: this is not the most elegant way to solve the task, there are better approaches

;-)