https://ac.nowcoder.com/acm/contest/161/A?&headNav=www
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
int vis[257],ans=1e6+1,sum;
string str;
int main()
{
cin>>str;
for(int l=0,r=0;r<str.length();r++)
{
if(++vis[str[r]]==1)sum++;
if(sum<26)continue;
while(l<r&&vis[str[l]]>1)vis[str[l++]]--;
ans=min(ans,r-l+1);
}
cout<<ans;
return 0;
}