1825A - LuoTianyi and the Palindrome String - CodeForces Solution

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<iomanip>
#include<map>
#include<iterator>
#include<string>
#include<list>
#include<set>
#define int long long
using namespace std;

const int MAXN = 1e5 + 3;
int a[MAXN];
 
void solve() {
	string s; cin >> s;
	int k = 0;
	for (int i = 1; i < s.length(); i++) {
		if (s[i] == s[i - 1]) k++;
	}
	if (k == s.length() - 1)
		cout << "-1\n";
	else cout << s.length() - 1 << '\n';
}	

int32_t main() {
	ios_base::sync_with_stdio(false);
	cout.tie(0); cin.tie(0), cerr.tie(0);
	int t;
	cin >> t;
	//t = 1;
	while (t--)
		solve();
	return 0;
}