Tap here to switch tabs
Problem
Submissions

Problem: Index Pairs of a String

Index Pairs of a String asks you to find every pair of positions whose substring appears in a given text and word array, returning pairs sorted by starting index and then ending index.

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 a 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

  • 1≤1 \leq words[i].length ≤50\leq 50

  • text and words[i] consist of lowercase English letters.

  • All the strings of words are unique.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Index Pairs of a String

Index Pairs of a String asks you to find every pair of positions whose substring appears in a given text and word array, returning pairs sorted by starting index and then ending index.

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 a 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

  • 1≤1 \leq words[i].length ≤50\leq 50

  • text and words[i] consist of lowercase English letters.

  • All the strings of words are unique.