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

Solution: Longest Common Suffix Queries

Explore how to build and query a reversed trie to solve longest common suffix queries efficiently. Understand the use of tries for suffix matching, optimizing for smallest length and earliest index, and analyze time and space complexities relevant to coding interviews.

We'll cover the following...

Statement

You are given two arrays of strings, wordsContainer and wordsQuery.

For each string wordsQuery[i], find the string in wordsContainer that shares the longest common suffix with it.

  • If multiple strings in wordsContainer share the same longest suffix, choose the one with the smallest length.

  • If two or more such strings have the same smallest length, choose the string that appears earliest in wordsContainer.

Return an array of integers ans, where ans[i] is the index of the chosen string in wordsContainer for the query wordsQuery[i].

Constraints:

  • 1≤1 \leq wordsContainer.length, wordsQuery.length ≤104\leq 10^4

  • 1≤1 \leq wordsContainer[i].length ≤5∗103\leq 5 * 10^3 ...