Fixed. Was missing the python tag

In your pycharm test case, try adding some numbers into the test string, see if it still passes

Quite right. It does sound like it should always be '1'. Updated description as suggested.

Thanks fakedup, that's indeed correct. In your example above you are counting digits. I missed that before. Only a-z and A-Z should be counted

Thanks for pointing that out. Updated with the correct line

I've changed the requirements so that the resulting list should be returned from the function.

When I run the tests with an invalid expected result, I get "('t', 12) should equal ('t', 15)" as a message. So I think what you are failing on is the length of the result, as I check for that too. It is entirely possible that your result has too many entries. I will adjust the tests to give better messages.

There's only one unit test that has a character that occurs 15 times. The string for that is:

IWT LDGAS XH HIXAA P LTXGS EAPRT, STHEXIT BN TUUDGIH ID BPZT RATPG PCS ETGUTRI HTCHT DU XI.

Not sure why you are getting that string back for the failed test.

One of the test cases has one letter occur 12 times.

Updated and closed the string correctly. Thanks.

These test cases are out of date. I updated them to fix these errors a few days ago (see comments below). I'm not sure why you are seeing the old versions.

Yes, apologies. I've fixed it now. New to this, so forgot to edit both test cases. Thank you

Good catch. Letters with the same frequency should be sorted alphabetically. However this wasn't correctly reflected in my test cases and I have now fixed this. I've also updated the description to add this bit of information.

Of course this will break any existing solutions now.

Updated kata to fix issues

Thanks, that helps. So basically just pass the list to process and append to it each recursion?

And yes, the test isn't great.

I've updated it, please confirm it's an improvement.

Thanks