Search⌘ K
AI Features

Solution: Index Pairs of a String

Solution: Index Pairs of a String asks you to find every substring of text that matches a word, return its start and end indices, and sort pairs by start then end.

Statement

Given a string text and an array of strings words, return a list of all index pairs [i, j] such that the substring text[i...j] is present in words.

Return the pairs [i, j] in sorted order, first by the value of i, and if two pairs have the same i, by the value of j.

Constraints:

  • 1≤1 \leq text.length ≤100\leq 100

  • 1≤1 \leq words.length ≤20\leq 20 ...