C. K-Dominant Charactertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s consisting of lowercase Latin letters. Character c is called k-dominant iff each substring of s with length at least k contains this character c.You have to find minimum k such that there exists at least one k-dominant character.InputThe first line contains string s consisting of lowercase Latin letters (1 ≤ |s| ≤ 100000).OutputPrint one number — the minimum value of k such that there exists at least one k-dominant character.ExamplesInputabacabaOutput2InputzzzzzOutput1InputabcdeOutput3
Inputabacaba
Output2
['binary search', 'implementation', 'two pointers', '*1400']