public class Solution { // This problem is exactly similar to longest palindromic substring. Just need to add count++. // Generate all the substrings of a string and expand around the centre to see if it formas a palindrome private int count = 0; public int countSubstrings(String s) { for(int i=0; i=0 && right < s.length() && s.charAt(left) == s.charAt(right)) { count++; left--; right++; } } }