Available question text
Given a string and a list of words, return all index pairs [i, j] where the substring text[i..j] matches any word from the list (overlapping matches allowed), with the pairs sorted by start then end. The core challenge is efficient multi-pattern string matching to find all occurrences of the given words in the text.
Related questions
Continue with questions that share topics or the same question type.
- Decoded String at Index
Coding
- Evaluate the Bracket Pairs of a String
Coding
- Find Maximum Number of String Pairs
Coding
- Find the Index of the First Occurrence in a String
Coding · Boyer–Moore String-Search Algorithm · Knuth–Morris–Pratt Algorithm · String
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1065. Index Pairs of a String
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source