I think this problem can be solved by KMP algorithm in O(n) time. I find
suffix tree hard to implement.
On Tue, Jul 5, 2011 at 9:43 PM, Aakash Johari wrote:
> Its probably Longest repeating substring problem. So it can be solved with
> suffix array/tree easily in O(n) time.
>
>
> On Tue, Jul 5,
Its probably Longest repeating substring problem. So it can be solved with
suffix array/tree easily in O(n) time.
On Tue, Jul 5, 2011 at 9:07 AM, Akshata Sharma wrote:
> @aakash: see this. I came across this question here
>
> http://geeksforgeeks.org/forum/topic/largest-unique-substring-from-a-st
@aakash: see this. I came across this question here
http://geeksforgeeks.org/forum/topic/largest-unique-substring-from-a-string-google
On Tue, Jul 5, 2011 at 3:15 PM, Aakash Johari wrote:
> Please make problem clear with example. Longest unique substring is the
> string itself, or i have misund
Please make problem clear with example. Longest unique substring is the
string itself, or i have misunderstood the problem.
On Mon, Jul 4, 2011 at 11:53 PM, Navneet Gupta wrote:
> I think you guys are on different page. There is a difference between
> substring and subsequence.
> http://en.wikipe
I think you guys are on different page. There is a difference between
substring and subsequence.
http://en.wikipedia.org/wiki/Subsequence#Substring_vs._subsequence
This question asks what is the longest SUBSTRING which is unique
(there could also be none or multiple if lengths are equal)
^Thinkin
This link can be useful.
http://geeksforgeeks.org/?p=12998
-
Azhar.
On Tue, Jul 5, 2011 at 11:31 AM, Akshata Sharma
wrote:
> someone please suggest me an efficient way to find the longest unique
> substring in a given string..
>
> --
> You received this message because you are subscribed to the
someone please suggest me an efficient way to find the longest unique
substring in a given string..
--
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 grou