title: Count All Palindrome Sub-Strings in a String
body: <p>Here I want to find all possible palindromes in a string. </p>
  
  <p>palindrome meaning:- a word, phrase, or sequence that reads the same backwards as forwards,</p>
  
  <p>e.g. madam or nun. </p>
  
  <p>So I took a string. Split it into a list. Then took every element in list at a time. Then took combinations of all the elements until last element of list.</p>
  
  <pre><code>a=str(input("enter the string:-"))
  
  b=a.split()
  
  for i in range(len(b)):
  
      for j in range(i+1,len(b)):
  
          t=b[i:j]
  
          r=t.reverse()
  
          if t == r:
  
              print(t)
  </code></pre>
  
  <p>I can't get any output even after I wrote the code as logical as I can</p>
  
  <p>For example:-</p>
  
  <p>if <code>a="Rotator"</code></p>
  
  <p>output:- </p>
  
  <pre><code>tat
  otato
  </code></pre>
  
  <p>and many if possible in it.</p>
  
  <p>I can't find where I have gone wrong, or where loophole is.</p>