Suppose we need to find if some text contains a pattern or any of its anagrams. I will explain how you can do it in O(n) time. Let’s consider the example below: Text: cedaabd Pattern: abad Here are all possible 4-letter anagrams of abad: aabd aadb abad abda adab adba baad bada bdaa daab daba … Read more
Here I am just trying to explain KMP algorithm in plain english. I will also explain worst time complexity & why it is O(m + n). We will take two examples, one with no repeatable character in the pattern & another with repeatable characters in the pattern. Pattern With Repeatable Characters: Text: aaaabaabab Pattern: aaaaa … Read more
In this post, I will try to explain Rabin-Karp algorithm & its worst time complexity. Rabin-Karp algorithm is based on hash matching. Let’s take an example. Text: aadabcPattern: abc Let’s create a table as below & represent each letter with some arbitrary number. We will use it to calculate hash. a b c … Read more