2 High
Statement
Goal
Given a string str, find the second highest frequency of repeated characters.If different characters are tied for the highest frequency, then print the next highest frequency.
If there isn't a second highest frequency then print "
Input
Line 1: A string of characters: str
Output
Single line output: The second highest frequency of characters. If there is none, print "-1 ".
Constraints
1 ≤ length(str) ≤ 100
Example
Input
aaabbc
Output
2
Game modes
Fastest, Shortest
Test cases
Simple Five Test
Input
aaabbc
Output
2
Validator 1 Validator
Input
orfsbasywyyrmysbbtydggdswgmrrfpraywwrdydfgssosttryfefsrtdtryhtbrsysbtt
Output
8
High Low Test
Input
mmmXXXXmmnYYY
Output
4
Validator 2 Validator
Input
tapiADeOKTJLhcofgdbHhdHADOcetpJbLKTfagioDoOLHbcATheKfJidgpa
Output
2
BIggg Test
Input
ipOHLeTtdfDcJhAKgbaobeOHoJLKcApTidDgtfhadocJDtLHfbeaigpOhTAKdKhoDaiAbHegpJtOfLcTiTbpOacKtofdLDhHJgAe
Output
-1
Validator 3 Validator
Input
iTdtdoffoDDeKTTdJbhhKoDpLKJTioiiKOafegActctDOJfTaLKeebTepAHLDdLTTgJfdifOtODgtoOpfJJbfDJfiaeHephHbgtd
Output
8
Small Test
Input
a
Output
-1
Validator 4 Validator
Input
ecdbaabecdeabdcdbaceacebdaebcdbadcedeacbdbaceeadcb
Output
-1
Any Test
Input
@&#i8223F$
Output
1
Validator 5 Validator
Input
n@6%3@$6sn$$iis*Mj7@D44$@mam$$FmM^@$mM@sj764^*fFS@a4n%42477nD*nsm3@@$$#S^S@^nF$6
Output
6
Test 6 Test
Input
aaaBBBccc
Output
-1
Validator 6 Validator
Input
BBBcccAAADDDEEEeee
Output
-1
Test 7 Test
Input
aabbccddeeff
Output
-1
Validator 7 Validator
Input
ooppqqrr
Output
-1
Solution language
Solution
Stub generator input