I need your help guys.i am struggling to learn hashing and KMP especially its implementation part . i am not getting problems with sollutions or good explainations. i need some good resource so it will really be appreciated if anyone can provide me with the same .
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 151 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 23.12.2024 07:31:29 (k2).
Десктопная версия, переключиться на мобильную.
При поддержке
The competitive programmers handbook explains it well: https://cses.fi/book/book.pdf
A modification is: You should hash with two prime moduli (1e9 + 7 and 1e9 + 9 worked for me) as one modulus is not enough to prevent collisions.
Maybe there are more precautions that I am too inexperienced to know about.
The only time I used string hashing was to solve this problem: https://codeforces.net/problemset/problem/271/D
I will suggest you these two Links for getting familiar with KMP This Video and Brlliant.org
CP-Algorithms has a nice article on string hashing: https://cp-algorithms.com/string/string-hashing.html
CP-Algorithms explanation about KMP is also really nice. I like how they introduced step by step optimizations in the algorithm.