Why this code passes only one test case

#1

#include
#include
using namespace std;
bool ispalindrome(char a[]){
int i=0;
int j=strlen(a)-1;
while(i<j){
if(a[i]!=a[j]){
return false;
}
i++;
j–;
}
return true;
}
int main() {
char a[1000];
cin.getline(a,1000);
if(ispalindrome(a)==true){
cout<<strlen(a)<<endl;
}

return 0;

}

#2

hi @rathidevesh906_1dcc73a061c159bb u have to count no of substrings which are palindrome
refer

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.