algorithms

palindromic-substrings.cpp (859B)

---

 class Solution {
 public:
     int countSubstrings(string s) {
         
         // idea:
         // move out from each index, incrementing as we find
         // more valid palindromes
         // wctc = O(n^2)
 
         int count = 0;
 
         for(int i = 0; i < s.length(); ++i) {
             // have to add this to handle cases where
             for(int offset = 0; offset <= 1; ++offset) {
                 int left = i; 
                 int right = i + offset;
                 while(left >= 0 && right < s.length()) {
                     if (s[left] == s[right]) {
                         count += 1;
                         left -= 1;
                         right += 1;
                     }
                     else {
                         break;
                     }
                 }
             }
           
 
         }
 
         return count;
     }
 };