Sir I have solved this problem without using dp.
I am unable to understand the dp approach for the same.
What could be a dp approach that can be used ?
Palindromic Quaries
Dp table will be filled in a manner in which from ith to jth index, whether the string is a palindrome or not.
All you have to do is fill the dp and then did the query in O(1) time.
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.