Count palindromic substrings

#1

is it done by sliding window concept

#2

hi @kumarakash121005
this problem is not based on sliding window concept…
u can refer this -->

#3

it is dp solution but dp is not studied by me

#4

hi @kumarakash121005
U can do it by brute force method also ie. Generate all substring and individually check if they are palindrome and maintain a count of that… but it’s complexity will be very high…

#5

hi @kumarakash121005


this is the brute force method… generate all substrings and individually check if they are palindrome and maintain a count of them…

#6

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.