Leetcode Problem 1065. Index Pairs of a String

Algorithm

1. Build a trie from the given words array.
2. Initialize an empty list to store the result index pairs.
3. Iterate over each character in the text string as the starting index i.
   • Initialize a pointer p to the root of the trie.
   • For each subsequent character at index j, check if there is an edge from p labeled with text[j].
   • If such an edge exists, move p to the corresponding child node.
   • If the node p is marked as a word, add the index pair [i, j] to the result list.
   • If no edge exists, break the inner loop and proceed with the next starting index i+1.
4. Return the result list sorted by the first and second coordinates.