#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

#define  prec(n)        fixed<<setprecision(n)
#define  optimize       ios::sync_with_stdio(0); cin.tie(0);
#define  PI             acos(-1.0)
#define  RESET(a, b)    memset(a, b, sizeof(a))
#define  pb             push_back
#define  pii            pair<int,int>
#define  pll            pair<ll,ll>
#define  vii            vector<int>
#define  vll            vector<ll>
#define  ff             first
#define  ss             second
#define  sz(v)          v.size()
#define  all(v)         v.begin(),v.end()

int const MOD=(int) 1e9+7;
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
inline ll mod(ll a, ll m){ if(a<0) return m-(abs(a)%m); else if(a<m) return a; else return (a%m); }
const int N = 3000006;
const int MAX=500005;

int main()
{
    optimize
    int t;
    cin>>t;
    while(t--){
       int n,mx=1e9,cnt=0;
       cin>>n;
       int a[n+2];
       set<int>st;
       vector<int>v[n+2];
       for(int i=0;i<n;i++){
        cin>>a[i];
        v[a[i]].pb(i);
        st.insert(a[i]);
       }
       if(st.size()==1){
        cout<<0<<"\n";
        continue;
       }
       //for(auto x : v[1]) cout<<x<<" ";
       for(auto it=st.begin();it!=st.end();it++){
          if(v[*it][0]!=0) cnt++;
          for(int i=1;i<sz(v[*it]);i++){
             if(v[*it][i]-v[*it][i-1]!=1) cnt++;
          }
          if(v[*it][sz(v[*it])-1]!=n-1) cnt++;
          mx=min(mx,cnt);
          cnt=0;
       }
       cout<<mx<<"\n";
    }
}
