Codeforces Round 872 (Div. 2) 1825A - LuoTianyi and the Palindrome String Solution

  


Problem Link :  https://codeforces.com/contest/1825/problem/A

Solution in C++:

  1. /// Author : AH_Tonmoy
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4. int32_t main() {
  5. ios_base::sync_with_stdio(0);
  6. cin.tie(0);
  7. int t;
  8. cin >> t;
  9. while (t--) {
  10. string s ;
  11. cin >> s ;
  12. set<char>st;
  13. for ( int i = 0 ; i < s.size() ; i++) {
  14. st.insert(s[i]);
  15. }
  16. if (st.size()== 1 ) cout <<"-1\n";
  17. else cout <<s.size()-1 <<"\n";
  18. }
  19. }

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.