@balaji : i think u understand the question in wrong way !!
The solution is to use Manchar Algorithm !! But thats hard to implement
On Wed, Jun 22, 2011 at 12:05 AM, Balaji S wrote:
>
>
> LCS(string,reverse(string)) ?? but this is not O(n) ryt..
>
>
>
> --
> With Regards,
> Balaji.S
>
>
> -
LCS(string,reverse(string)) ?? but this is not O(n) ryt..
--
With Regards,
Balaji.S
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send
Does any one know how to return the "Longest palindrome in a string in
O(n)".
>From googling i found that we can use suffix trees but there is no code. I
am looking for logic and also for running code.
Thanks,
Swathi
--
You received this message because you are subscribed to the Google Groups
"
