Boyer Moore Algorithm for Pattern Searching

You are given a string text and a string pattern. Your task is to find all occurrences of pattern in the string text and return an array of indexes of all those occurrences. Assume that the length of text is always greater than the length of pattern.

Example:

Input:

text = "this is a good place to have a good start"
pattern = "good"

Output:

[10, 31]

Explanation:

The pattern "good" is found at index 10 and 31 in the text.

Constraints:

1 ≤ T ≤ 5

1 ≤ M

Question

Boyer Moore Algorithm for Pattern Searching

You are given a string text and a string pattern. Your task is to find all occurrences of pattern in the string text and return an array of indexes of all those occurrences. Assume that the length of text is always greater than the length of pattern.

Example:

Input:

text = "this is a good place to have a good start"
pattern = "good"

Output:

[10, 31]

Explanation:

The pattern "good" is found at index 10 and 31 in the text.

Constraints:

1 ≤ T ≤ 5
1 ≤ M < 100
1 ≤ N < M, where N is the length of the pattern and M is the length of the text.
Time Limit: 1 sec

Note:

If no occurrence of the pattern is found in the text, return an array containing -1.

Accepted Answer

Implement Boyer Moore Algorithm to find all occurrences of a pattern in a text string.

Implement Boyer Moore Algorithm for efficient pattern searching.
Iterate through the text string and compare the pattern with each substring of the text.
Return an array of indexes where the pattern is found in the text.
If pattern not found, return an array containing -1.