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

Solution: Longest Common Suffix Queries

Explore how to efficiently find the longest common suffix between query strings and a container of words by using a reversed trie. Understand how to build and traverse the trie to identify the best candidates and handle ties based on length and index. This lesson helps you implement a solution with optimal time and space complexity for suffix matching tasks.

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