#include <bits/stdc++.h>
using namespace std;
#define cin(v)        \
    for (auto &i : v) \
        cin >> i;
#define cout(v)       \
    for (auto &i : v) \
        cout << i << " ";
#define br cout << '\n';
#define ll long long
#define ull unsigned long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define MOD 1000000007
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" \
                  << "\n";

void Warding()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
ll n;
vector<ll> v, ans;
vector<ll> m(2 * 1e5 + 5, 0);
map<ll, ll> memo;

bool is_valid(int i)
{
    return i >= 0 and i < n;
}

// int dp(int i, int cnt)
// {
//     if (!is_valid(i))
//         return 0;
//     if (memo[i] != 0)
//         return memo[i];
//     if (i == n - 1)
//     {
//         return cnt + 1;
//     }
//     if (m[v[i]] > i)
//     {
//         return memo[i] = 1 + dp(m[v[i]], cnt + 1);
//     }
//     else
//     {
//         return memo[i] = 1 + dp(i + 1, cnt + 1);
//     }
// }

void solve()
{
    ll cnt = 0, Minn = INT_MAX;
    cin >> n;
    v.resize(n);
    vector<ll> m2(2 * 1e5 + 5, 0);
    map<pair<int, int>, int> close;
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
        m2[v[i]]++;
        m[v[i]] = i;
    }
    int j = 0;
    for (int i = 0; i < n; i++)
    {
        if (m2[v[i]] > 1)
        {
            ll holder = (m2[v[i]] - 1) + ((n - 1) - m[v[i]]) + j;
            Minn = min(Minn, holder);
        }
        j++;
    }
    Minn = min(Minn, n - 1);
    cout << Minn << '\n';
}

int main()
{
    Warding();
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    Time
}