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.
↵
your help will be greatly appreciated.