Recently I got to know about this O(n) solution for longest palindromic substring and am stunned by the working of the algorithm. How could an algorithm work better than a grid DP solution?! Would be nice if anyone could break down the algorithm for me. Also looking forward to know about more such daring algorithms that can beat the crap out of the traditional dynamic programming solutions. Thank you.