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 \leq$ text.length $\leq 100$

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

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

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

• All the strings of words are unique.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.