FrontendX
Shortest Matching Substring
medium
Description
AI Assistance
Solution
Test Cases
Test Result
Submissions
Canvas
Shortest Matching
Substring
Find shortest substring matching pattern using string algorithms and pointer narrowing.
Examples
Example 1
Input:
[1,2,3]
Output:
-1
Example 2
Input:
[1,2,3]
Output:
-1
Hints
Hint 1
Use KMP for pattern matching.
Hint 2
Try expanding window with two pointers.
Hint 3
Minimize window size while containing pattern.
Shortest Matching Substring
Find shortest substring matching pattern using string algorithms and pointer narrowing.