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

Solution: Index Pairs of a String

Explore how to use the trie data structure to find all starting and ending index pairs of substrings present in a list of words within a given text. Understand how to build and traverse a trie for efficient string matching, and learn the time and space complexity considerations of this approach.

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