when we write,
if(“go” in s): …
what is the time complexity ,I mean is it O(n*m) brute forces or O(n) KMP implemented in background?
Time Complexity
Hey @nikhil_sarda, the code is combination of Boyer-Moore and Horspool. So complexity is way more difficult to study,
Hope this resolved your doubt.
Plz mark it as resolved in my doubts section. 