GhostDoc :D

^^ ditto - how?

Edit: just read the above - yeah I'm not solving this in ANOTHER language so I can add a C# version :P

Would be good to have a C# version of this Kata (since the first and last one in the series already do)

Someone really needs to fix the C# tests...

No they don't

3 - 2 <= 1

Well that was a bit trickier than I first thought it would be
Who would have thought that 26! would be such a big number

If n is 0, instead of returning an empty array, return an array with one element (0.0) in it!

Aaaah if n is 0, instead of returning an empty array, return an array with one element (0.0) in it!

End up figuring this out? I get the same thing...

Yeah sorry my bad - I tried deleting my question but don't think I can?

Ah yeah that's all it was - ignore me - I'm jetlagged :P

Sort by PhoneNumber maybe?

testarr = new string[]{
"4873279",
"ITS-EASY",
"888-4567",
"3-10-10-10",
"888-GLOP",
"TUT-GLOP",
"967-11-11",
"310-GINO",
"F101010",
"888-1200",
"-4-8-7-3-2-7-9-",
"487-3279"};

result = new string[]{
"310-1010:2",
"487-3279:4",
"888-4567:3"};

I'm confused - how do you decide what the order in the result should be?
My code returns this (ordered based on first occurance)

        var myExpectedResult = new string[]{
            "487-3279:4",
            "888-4567:3",
            "310-1010:2"};

Which is apparently wrong.

Could also sort by count, but you don't seem to do that either...