title: Determining if an integer can be expressed as a palindromic sum
body: <p>I was asked this question in an interview:</p>
  <blockquote>
  <p>An integer is <em>special</em> if it can be expressed as a sum that's a palindrome (the same backwards as forwards). For example, 22 and 121 are both special, because 22 equals <code>11+11</code> and 121 equals <code>29+92</code>.</p>
  <p>Given an array of integers, count how many of its elements are special.</p>
  </blockquote>
  <p>but I couldn't think of any solution. How can this be done?</p>