ABC-poisto

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
void solve() {
	string str;
	cin >> str;
	int n = str.size();
	vector<int> cou(3, 0);
	for (auto c : str) cou[c - 'A'] += 1;
	int mx = max(cou[0], max(cou[1], cou[2]));
	cout << min(2 * (n - mx), n - (n % 2)) << '\n';
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
 
	int t;
	cin >> t;
	for (int ti = 0; ti < t; ++ti) solve();
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED