| # | User | Rating |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | TheScrasse | 145 |
| 10 | nor | 144 |
Hi
I am trying to understand suffix automaton data structure and applications related to that. But I couldn't find any relevant resources for it. I have gone through following tutorials.
http://discuss.codechef.com/questions/39945/sstory-editorial
http://e-maxx.ru/algo/suffix_automata#17
But as you can see first tutorial is not very descriptive and second tutorial is in Russian. Can someone post a link for nice english tutorial.
Thanks.
Hi
Can someone please describe the solution for the following problem which was asked in the quora haqathon 2014. Thanks in advance.
https://www.hackerrank.com/contests/quora-haqathon/challenges/relatedquestions
