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

Solution: Longest Common Suffix Queries

Explore how to solve longest common suffix queries by building a reversed trie from a words container. Understand the process of inserting words back-to-front, storing best candidate indices, and querying the trie to find optimal suffix matches based on length and earliest appearance. This lesson equips you with methods to implement efficient string matching for coding interview problems involving suffix queries.

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