#include <bits/stdc++.h>

#define pb push_back
#define forn(i,n) for(int i=0; i<n; i++)
#define el '\n'
#define sz(v) (int(v.size()))
#define d(x) cout<< #x<< " " << x<<el
#define all(v) v.begin(),v.end()
#define fi first
#define se second

using namespace std;

typedef vector<int> vi;
typedef long long ll;

const int nax = 3e5 + 20;
const int mod = 1e9 + 7;

int solve(vector<int> &a, int n){

  map<int, vector<int>> pos;
  int mx = -1e9;
  vector<int> pre(n), suf(n);
  int sum = 1e9;
  forn(i,n){
    sum = min(sum, a[i]);
    pre[i] = sum;
    pos[a[i]].pb(i);
    mx = max(mx, a[i]);
  }

  sum = 1e9;
  for(int i = n - 1; i >= 0; --i){
    sum = min(sum, a[i]);
    suf[i] = sum;
  }
  int l = -1, r = -1;
  int ans = 1e9;

  int val = 1e9;

  for(auto &e : pos){
    val = min(val, e.fi);
    int mn = 1e9;
    mn = min(mn, mx - e.fi);

    if(l == -1){
      l = e.se[0];
      r = e.se[0];
    }

    while(l >= e.se[0]){
      mn = min(mn, mx - a[l]);
      --l;
    }
    while(r <= e.se.back()){
      mn = min(mn, mx - a[r]);
      ++r;
    }
    int mn_pre = (l == -1 ? 1e9 : pre[l]);
    int mn_suf = (r == n ? 1e9 : suf[r]);
    ans = min(ans, mx - min({val + mn, mn_pre, mn_suf}));
  }
  return ans;
}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  int t;
  cin >> t;
  while(t--){
    int n;
    cin >> n;
    vector<int> a(n);
    int mx = 0;
    forn(i,n){
      cin >> a[i];
      mx = max(mx, a[i]);
    }
    int ans = solve(a, n);
    forn(i,n){
      a[i] = -a[i];
    }
    ans = solve(a, n);
    cout << ans << el;

  }

  
}