"""
Linear time string matching algorithm from Knuth, Morris and Pratt.
Mathematical complexity: O(m + n), where n is the length of the sequence and m is the length of query string
"""

def KMP():
    raise NotImplementedError

def naiveStringMatcher():
    raise NotImplementedError

def robinkarp():
    raise NotImplementedError
"""
Linear time string matching algorithm from Knuth, Morris and Pratt.
Mathematical complexity: O(m + n), where n is the length of the sequence and m is the length of query string
"""

def KMP():
    raise NotImplementedError

def naiveStringMatcher():
    raise NotImplementedError

def robinkarp():
    raise NotImplementedError
Linear time string matching algorithm from Knuth, Morris and Pratt. Mathematical complexity: O(m + n), where n is the length of the sequence and m is the length of query string