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:
text.length
words.length
words[i].length
text and words[i] consist of lowercase English letters.
All the strings of words are unique.
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:
text.length
words.length
words[i].length
text and words[i] consist of lowercase English letters.
All the strings of words are unique.