Update longest-happy-prefix.py

Author: kamyu104

Python/longest-happy-prefix.py

@@ -46,7 +46,7 @@ def check(l, s):
             suffix = (suffix + (ord(s[len(s)-(i+1)])-ord('a'))*power) % M
             power = (power*D)%M
             if prefix == suffix:
-                # we assume M is a very large prime without collision
+                # we assume M is a very large prime without hash collision
                 # assert(check(i+1, s))
                 result = i+1
         return s[:result]