Sherlock and the Valid String Sherlock considers a string to be valid if all characters of the string appear the same number of times. It is also valid if he can remove just character at index in the string, and the remaining characters will occur the same number of times. Given a string , determine if it is valid.For example, if , it is a valid string because frequencies are . So is because we can remove one and have of eac.. 더보기 이전 1 ··· 34 35 36 37 38 39 40 ··· 108 다음