#K92797. Good String Determination
Good String Determination
Good String Determination
Given a string containing only lowercase English letters, a string is considered good if every distinct character in the string occurs the same number of times. For example, the string "aabb" is good since both 'a' and 'b' occur twice, whereas "aabbbb" is not good because the characters occur a different number of times.
If the string is empty, it is considered good.
inputFormat
The input consists of a single line containing a string of lowercase English letters. The string might be empty.
outputFormat
Output True
if the string is good; otherwise, output False
.
aabb
True