problem about palindromic numbers
Difference between en1 and en2, changed 7 character(s)
i'm trying to solve ![ [this](https://www.hackerearth.com/codegenesis-week-6/algorithm/panda-and-palindrome/description/)  problem but i can't find any algorithm better than O(n^2) !↵
↵
your help will be greatly appreciated.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Mid0 2015-10-25 20:24:11 7
en1 English Mid0 2015-10-25 20:22:59 251 Initial revision (published)