My solution to AIBOHP is showing WA. Can anyone kindly help me out with it.
My solution:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll t;
cin >> t;
while(t–)
{
string s;
cin >> s;
ll n = s.size();
ll maxlen = 1;
int dp[n][n];
memset(dp,0,sizeof(dp));
for(ll i=0;i<n;i++)
{
dp[i][i] = 1;
}
for(ll i=0;i<n-1;i++)
{
if(s[i] == s[i+1])
{
dp[i][i+1] = 1;
maxlen = 2;
}
}
for(ll i=3;i<=n;i++)
{
for(ll j=0;j+i-1<n;j++)
{
if(dp[j+1][j+i-2] == 1 && s[j] == s[j+i-1])
{
dp[j][j+i-1] = 1;
maxlen = max(maxlen,i);
}
}
}
cout << n - maxlen << endl;
}
return 0;
}