Nice explanation for identity.

Without the use of infix operators it's a bit clearer: (chars.head to chars.last).diff(chars).head

whats going on here, and is this making your computation faster?

Bro, I got it, i was typing another question and then i realized that I had to also compare the string with the 2:, 1:, =:, not just the lower case letters. Thanks for the help

Hey I checked and there is no problem in the tests (you can notice that many guys passed the Scala kata). I am afraid your code is wrong somewhere. Sorry that you passed most of your day on it:-)

Hey so I dont know what exactly is going on with these test cases but I'm certain I've written the code to specifications in Scala. The way I understand it is that you need to order the final list by descending order, and then by ascending alphabetical order but in the third test case in scala the expected output for the secondary order is not in ascending alphabetical order I don't know exactly what order it's in, Also I've tried both descending and ascending alphabetical order. Can you please check it as I would love to have this one finished, spent most of my day on it. Thank You !!!

Congrats bro, this is another level I was looking at this for a solid 10 minutes before i realized how it was working