Maybe count the amount of each letter as you already did. then check for each letter how many times there are. So lets say you habe two times 'h' and only time 'a' Then you first check how many 'h's there are. then you go to a and see there is only one. If there is only one a it can be printed 0 times
Обсуждают сегодня