Strings - Count Plaindrome Substrings

this is my code please only on test case is passing help me out

hi @akshat42bajpai
refer this -->

u can read full explanation over here

what is memset that is mentioned here in GFG site…and plus i haven’t studied dynamic programming yet… can you just explain a bit please what’s hapenning here

hi @akshat42bajpai
memset is an inbuilt function to initialize the whole array…
rest if u haven’t studied dp, u can do it using brute force way (generate all possible substring and individually check if they are palindrome and maintain a count for the same), but its complexity would be very high…

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.