1821C - Tear It Apart - CodeForces Solution

#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define endl '\n'
#define f(n) for(int i=0 ;i<n;i++)
#define fj(n) for(int j=0 ;j<n;j++)
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define fast cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
int dx[] = { +0, +0, -1, +1, +1, +1, -1, -1 };
int dy[] = { -1, +1, +0, +0, +1, -1, +1, -1 };

using namespace std;

// p not com / p1*p2 not com
// p*p || p*p*p com
// we can make com num from 2 same prime num or 3 diff primes

int main()
{
    fast
    int T; cin>>T;
    while (T--)
    {
      string s; cin>>s;
      int ans=1e9;
      for(char ch='a';ch<='z';ch++)
      {
          int cnt=0,dis=0,moves=0;
          f(s.size())
          {
              if(s[i]==ch)dis=max(dis,cnt),cnt=0;
              else cnt++;
          }
          dis=max(dis,cnt);
          while (dis)
          {
              moves++;
              dis/=2;
          }
          ans=min(ans,moves);
      }
      cout<<ans<<endl;

    }

    return 0;
}