647. Palindromic Substrings - LeetCode Solution

class Solution:
    def countSubstrings(self, s: str) -> int:
        
        count =0


        for i in range(len(s)):
            for j in range(i, len(s)):
                if s[i:j+1] == s[i:j+1][::-1]:
                    count+=1
                    
                    
        return count