Implement string pattern matching

Q: Implement string pattern matching

This question evaluates proficiency with string pattern matching algorithms, including handling wildcard semantics and algorithmic complexity analysis, within the coding and algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Implement a function that finds the first occurrence of a pattern P in a text T and returns the starting index (or -1 if not found). Follow-ups: compare the naive method to KMP and Rabin–Karp; extend the matcher to support wildcard characters '?' (match any single char) and '*' (match any sequence); discuss time and space complexity and key edge cases (empty strings, repeated patterns, very long inputs).

Implement string pattern matching

Overview

Comments (0)