NUMOFPAL - Number of Palindromes
Each palindrome can be always created from the other palindromes, if a single character is also a palindrome. For example, the string "malayalam" can be created by some ways:
* malayalam = m + ala + y + ala + m
* malayalam = m + a + l + aya + l + a + m
We want to take the value of function NumPal(s) which is the number of different palindromes that can be created using the string S by the above method. If the same palindrome occurs more than once then all of them should be counted separately.
The string S.
The value of function NumPal(s).
0 < |s| <= 1000
So problem can be formulated in another way:
Just outputs the number of palindromic substrings of the input string. (If the same palindrome occurs more than once then all of them should be counted separately.)
The quick brown fox jumps over the lazy dog:
why it should be 8??????
Answer should be 8