hackerrank: sherlock and the valid string

Fri, 05 Sep 2025 00:00:00 +0100

problem

Sherlock and the Valid String | HackerRank

attempts

final

There were too many attempts for me to justify including them all. The crux here was handling the edge cases.

Because, on the surface, it seems like we can easily solve the problem with a collections.Counter. Using it, we’d get back the frequencies of each character in the input string. So, checking the simplest case where all the characters appear the same number of times would be as simple as checking that the size of the set of the character frequencies is 1. All that’s then left would be to handle the case where the set happens to have 2 frequencies; any more than that and we know the string to be invalid.

hackerrank on jonah vairon

hackerrank: sherlock and the valid string

problem

attempts

final