Given a string, check if it is a rotation of a palindrome. For example “aab” is a rotation of “aba”.
The first line contains T denoting the number of testcases. Then follows description of testcases.
Each case contains a string.
For each test case, output "1" if string is rotation of a palindrome otherwise "0" in a new line.
1<=Length of the string<=100
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.