Re:O(n) algorithm to find longest palindromic substring w/o ...
by dhruvbird on Sunday April 08, 2012 @10:30PM
(#3815589)
Nope, see the section "A simple asymptotically optimal solution" - it doesn't use Suffix Arrays.
[ Parent
| on HN ]
There are no comments on this comment yet.