Re:O(n) algorithm to find longest palindromic substring w/o ...
by dhruvbird on Monday April 09, 2012 @01:28PM
(#3818051)
I should thank you for the brilliantly written article. All the claims have been mentioned clearly, and the reasoning strung together in a coherent manner.
I agree with the fact that getting the optimization isn't intuitive, but the basic O(n^2) on which the idea is based is almost trivial.
I agree with the fact that getting the optimization isn't intuitive, but the basic O(n^2) on which the idea is based is almost trivial.