The error message is bad, but it says the position for one of the entry is wrong (should be at 2nd position, but your code places it at 3rd)

Also, your code seems to only modify the value for each key-value pair of Dictionary, but not sort it accordingly.

Looks cool but not optimal, so far I think it's O(n) the optimal solution.

my 4kyu kata was a linq one liner. gg

I knew yout could do this but was too lazy to actually try lmao

Brute-forcing will not pass the tests as there is a solution with O(1) complexity available (like you said)

resolving

yes

Looks cool :)

CW cache issue when solution page has too much solutions. A resubmit may do the trick

Not a suggestion.

Unnecesary System import ;-)

I have got same trouble, althouth tryed three solutions, based on Queue, HashSet and dumb sorting array in-place. All solutions begins with check for empty or odd array.

A CW bug, of course.