can anyone explain the hashing solution of this problem?
thanks in advance :)
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
There is 2 parts in hash solution:
1) Largest substring(but not prefix or suffix) equal to prefix. Imagine that we know length of this string. Then we can check if there is a string of this length in O(N).
Let's notice if there is such string of length i + 1 there is string with length i. So we can do binary search to find this is O(n * logn)
2) We iterate over all possible answer's lengthes and check two things
a) This length is less than length in 1 part
b) Prefix of this length equals to suffix of this length(using hashes)
So we get O(n * logn) solution