Implementation Difficulty in the String Problem

Revision en3, by hulk_baba, 2016-12-31 22:00:27

Please go through this problem 716B. My idea is : 1. if length of string in less than 26 , print "-1" and return ; 2. calculate frequency of first 26 characters and then see how many characters are left out and how many '?' are available . 3. If left out == cnt['?'] it is possible. 4. If not go for next 26. 4. I tried it but failed on 18th test case here? Could you help me with my implementation. Or if you have more elegant implementation please suggest me.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English hulk_baba 2016-12-31 22:00:27 22 Tiny change: ' test case[Your text to link here...](http://c' -> ' test case [here](http://c'
en2 English hulk_baba 2016-12-31 21:59:52 30
en1 English hulk_baba 2016-12-31 21:58:50 612 Initial revision (published)