title: Find all substrings that are palindromes
body: <p>If the input is 'abba' then the possible palindromes are a, b, b, a, bb, abba.<br>
  I understand that determining if string is palindrome is easy. It would be like:</p>
  
  <pre><code>public static boolean isPalindrome(String str) {
   int len = str.length();
   for(int i=0; i&lt;len/2; i++) {
       if(str.charAt(i)!=str.charAt(len-i-1) {
           return false;
       }
   return true;  
  }
  </code></pre>
  
  <p>But what is the efficient way of finding palindrome substrings?</p>