Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Index Pairs of a String

Explore how to implement a trie data structure to find all index pairs of substrings in a given string that appear in a list of unique words. Learn to build the trie, traverse it for substring matching, and understand the time and space complexity involved in optimizing string search tasks.

We'll cover the following...

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