#2156

Find Substring With Given Hash Value

international master · 2130 · lc hard +32 · verified · 26% accepted · 447 likes · top 4%

Description

The hash of a 0-indexed string s of length k, with integers p and m, is defined as:

- hash(s, p, m) = (val(s[0]) * p⁰ + val(s[1]) * p¹ + ... + val(s[k-1]) * p^k-1) mod m.

Here val(s[i]) is the position of s[i] in the alphabet, with val('a') = 1 through val('z') = 26.

You are given a string s, integers power, modulo, k, and hashValue. Return sub, the first substring of s with length k such that hash(sub, power, modulo) == hashValue.

The test cases guarantee that an answer always exists.

A substring is a contiguous non-empty sequence of characters within a string.

Example 1:

Input: s = "leetcode", power = 7, modulo = 20, k = 2, hashValue = 0

Output: "ee"

Explanation: The hash of "ee" can be computed to be hash("ee", 7, 20) = (5 * 1 + 5 * 7) mod 20 = 40 mod 20 = 0.

"ee" is the first substring of length 2 with hashValue 0. Hence, we return "ee".

Example 2:

Input: s = "fbxzaad", power = 31, modulo = 100, k = 3, hashValue = 32

Output: "fbx"

Explanation: The hash of "fbx" can be computed to be hash("fbx", 31, 100) = (6 * 1 + 2 * 31 + 24 * 312) mod 100 = 23132 mod 100 = 32.

The hash of "bxz" can be computed to be hash("bxz", 31, 100) = (2 * 1 + 24 * 31 + 26 * 312) mod 100 = 25732 mod 100 = 32.

"fbx" is the first substring of length 3 with hashValue 32. Hence, we return "fbx".

Note that "bxz" also has a hash of 32 but it appears later than "fbx".

Code

1

2

3

class Solution:
    def subStrHash(self, s: str, power: int, modulo: int, k: int, hashValue: int) -> str:

class Solution:
    def subStrHash(self, s: str, power: int, modulo: int, k: int, hashValue: int) -> str: