ABC-poisto

#include <bits/stdc++.h>
using namespace std;
#define int long long
 
int solve(string s) {
  int n = s.size();
  vector<int> occ(256);
  for (char c : s) occ[c]++;
  int maxocc = *max_element(occ.begin(), occ.end());
  int others = n - maxocc;
  if (maxocc > others) {
    return maxocc - others;
  }
  return n % 2;
}
 
signed main() {
  ios::sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    int n = s.size();
    cout << n-solve(move(s)) << '\n';
  }
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED