Search Pattern (KMP-Algorithm)
Medium Accuracy: 65.53% Submissions: 4422 Points: 4

Given two strings, one is a text string, txt and other is a pattern string, pat. The task is to print the indexes of all the occurences of pattern string in the text string. For printing, Starting Index of a string should be taken as 1.

Example 1:

Input:
txt = "batmanandrobinarebat", pat = "bat"
Output: 1 18
Explanation: The string "bat" occurs twice
in txt, one starts are index 1 and the other
at index 18.


Example 2:

Input:
txt = "abesdu", pat = "edu"
Output: -1
Explanation: There's not substring "edu"
present in txt.


You don't need to read input or print anything. Your task is to complete the function search() which takes the string txt and the string pat as inputs and returns an array denoting the start indices (1-based) of substring pat in the string txt.
Note: Return an empty list incase of no occurences of pattern. Driver will print -1 in this case.

Expected Time Complexity: O(|txt|).
Expected Auxiliary Space: O(|txt|).

Constraints:
1 ≤ |txt| ≤ 105
1 ≤ |pat| < |S|

We are replacing the old Disqus forum with the new Discussions section given below.