ternarySearch.cpp

//codeforces.com/contest/1354/problem/B

#include "bits/stdc++.h"
using namespace std;

#define pb push_back
#define fr(i, n) for(int i = 0; i < n; i++)
#define frr(i, n) for(int i = 1; i <= n; i++)

#define dbg(x) cout << #x << " = " << x << endl
#define all(x) x.begin(),x.end()
#define ms(x, i) memset(x, i, sizeof(x))

#define p(x) cout << x << "\n"
#define pv(x) fr(i, x.size()) cout << x[i] << " \n"[i==x.size()-1]

#define f first
#define s second

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f;

int main() {
    fastio;

    int t;
    cin >> t;
    while (t--) {

        string s;
        cin >> s;
        s += '&';
        int n = s.size();
        int l = 0, r = 0, ans = INF;
        vi cnt(3, 0);
        while (r < n) {
            if (!cnt[0] || !cnt[1] || !cnt[2]) {
                cnt[s[r]-'1']++;
                r++;
                continue;
            }
            else {
                ans = min(ans, r-l);
                cnt[s[l]-'1']--;
                l++;
            }
        }

        if (ans == INF) p(0);
        else            p(ans);
    }
}