https://h30306.github.io/blog/tags/rolling-hash/Recent content in Rolling-Hash onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungWed, 01 Jul 2026 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-1147/Wed, 01 Jul 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1147/LeetCode 1147 note: build strings inward from both ends and cut a pair as soon as they match; cutting early is best, and any leftover middle counts as one chunkhttps://h30306.github.io/blog/leetcode/leetcode-1461/Mon, 05 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1461/LeetCode 1461 note: put every length-k substring in a set and check that its size reaches 2^k; the last start is len(s) - khttps://h30306.github.io/blog/leetcode/leetcode-2156/Sun, 04 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2156/LeetCode 2156 note: the first character has weight p^0, so sliding right to left needs only multiply by p, add the new character, and subtract the outgoing one times p^k; the modulus may not be prime, so no modular inverse