Leetcode 2156. Find Substring With Given Hash Value

Find the earliest length-k substring of s whose polynomial rolling hash (sum of val(ch)*power^i mod modulo) equals hashValue. This requires using modular arithmetic and an efficient rolling-hash/sliding-window approach to check all length-k substrings in O(n) time.