Fetching algorithms...

KMP String Matching Visualizer & Solution | Rulcode

60. KMP String Matching

Hard

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: text = "ABABDABACDABABCABAB", pattern = "ABABCABAB"

Output: [10]

Explanation: The pattern "ABABCABAB" occurs once in the text, starting at index 10.

Example 2:

Input: text = "AAAAA", pattern = "AAA"

Output: [0, 1, 2]

Explanation: The pattern "AAA" occurs three times in the text, starting at indices 0, 1, and 2.

Example 3:

Input: text = "ABCABCD", pattern = "ABCD"

Output: [3]

Explanation: The pattern "ABCD" occurs once in the text, starting at index 3.

Example 4:

Input: text = "GEEKS FOR GEEKS", pattern = "GEEK"

Output: [0, 10]

Explanation: The pattern "GEEK" occurs twice, once at the beginning and again with a space in between

Example 5:

Input: text = "THIS IS A TEST TEXT", pattern = "TEST"

Output: [10]

Explanation: The pattern "TEST" is found once starting at index 10

Constraints:

Time Complexity

O(n+m)

Space Complexity

O(m)

Loading problem details...

rulcode

60. KMP String Matching

Hard

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: text = "ABABDABACDABABCABAB", pattern = "ABABCABAB"

Output: [10]

Explanation: The pattern "ABABCABAB" occurs once in the text, starting at index 10.

Example 2:

Input: text = "AAAAA", pattern = "AAA"

Output: [0, 1, 2]

Explanation: The pattern "AAA" occurs three times in the text, starting at indices 0, 1, and 2.

Example 3:

Input: text = "ABCABCD", pattern = "ABCD"

Output: [3]

Explanation: The pattern "ABCD" occurs once in the text, starting at index 3.

Example 4:

Input: text = "GEEKS FOR GEEKS", pattern = "GEEK"

Output: [0, 10]

Explanation: The pattern "GEEK" occurs twice, once at the beginning and again with a space in between

Example 5:

Input: text = "THIS IS A TEST TEXT", pattern = "TEST"

Output: [10]

Explanation: The pattern "TEST" is found once starting at index 10

Constraints:

Time Complexity

O(n+m)

Space Complexity

O(m)

60. KMP String Matching

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Learn

Topics

Hint

Use Cases

60. KMP String Matching

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Learn

Topics

Hint

Use Cases