← All practice quizzes🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →
Quiz: String Matching — KMP and Rabin-Karp
5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass
Find every place a pattern appears in a text. Start with the simple O(n · m) search, then learn how KMP's prefix table and Rabin-Karp's rolling hash avoid repeated work.
Log in to take the quiz
Free account · see your score, answers and explanations, earn XP