DP - 25: Count all Palindrome sub-string in given String

Is it in a c language

Sir, how to do recursively? please explain

bro, u just explained the dp recurrence....that's a way....u must show how we are able to react to that recurrence.....not directly the recurrence......👎

why second for loop starting with i=n-2,in code can you please tell me

Why you kept j-i ==1 condition in loop sir?

‘BAB’ also a palindrome right? Why this is missed?

Given a value N, total sum you have. You have to make change for Rs. N, and there is infinite supply of each of the denominations in Indian currency, i.e., you have infinite supply of { 1, 2, 5, 10, 20, 50, 100, 200, 500, 2000} valued coins/notes, Find the minimum number of coins and/or notes needed to make the change for Rs N. and print all the coins .(source GeeksforGeeks) sir in this question can be solved by dp but unable to find out the value of coins plz help sir