Implement string matching with follow-up

Q: Implement string matching with follow-up

This question evaluates understanding of efficient string-matching techniques, handling of Unicode and very long inputs, and design of data structures for simultaneous multi-pattern search, within the Coding & 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

Given a text T and a pattern P, implement a function firstIndex(T, P) that returns the starting index of the first occurrence of P in T, or -1 if absent. Aim for O(|T| + |P|) time and O(|P|) extra space. Discuss how you would handle Unicode and very long inputs. Follow-up: extend your solution to support searching for k patterns P1..Pk simultaneously and return all starting indices for each pattern; outline the data structure and runtime trade-offs.

Implement string matching with follow-up

Overview

Comments (0)