← Microsoft questions

Substring Matching Algorithm

Filed under Microsoft

Given a text string and a pattern string, implement the Knuth-Morris-Pratt (KMP) algorithm to find the starting index of the first occurrence of the pattern in the text.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.