| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
Hello Everyone!
I have made a video tutorial on how we can compare substrings in constant time using string hashing in C++.
I have taken the problem from Codechef May CookOff "Chef Chefina and their friendship" which can be solved using hashing.
Check it out here
Thank You!
compare substrings in constant time
Wow. I am really interested in how your hashing function would compute the hash of a string in O(1).
After computation,you can compare in O(1) time. Computation takes O(n).
Erm. What is your comparison algo?
I meant to check if equal or not.
So how do you check if a string is equal to another?
With the hash value also I have been following you for a while, between you and me whats your real ID? https://cp-algorithms.com/string/string-hashing.html
Oh. I see. So you hash both strings first and you compare their hash values. I think that is only useful if you are hashing a large number of strings. And that is going to be quadratic in their length, which doesn't make much sense to me.
For comparison of substrings it does make sense.What's your real ID?