Runtime: 996 ms (Top 33.98%) | Memory: 14.1 MB (Top 94.23%)

Author: AnasImloul

scripts/algorithms/F/Find Substring With Given Hash Value/Find Substring With Given Hash Value.py

@@ -1,3 +1,4 @@
+# Runtime: 996 ms (Top 33.98%) | Memory: 14.1 MB (Top 94.23%)
 class Solution:
     def subStrHash(self, s: str, power: int, mod: int, k: int, hashValue: int) -> str:
         val = lambda ch : ord(ch) - ord("a") + 1
@@ -7,4 +8,4 @@ def subStrHash(self, s: str, power: int, mod: int, k: int, hashValue: int) -> st
             if i < len(s) - k:
                 hash = (mod + hash - power_k * val(s[i + k]) % mod) % mod
             res = i if hash == hashValue else res
-        return s[res:res + k]
+        return s[res:res + k]