Solution: Longest Common Suffix Queries
Understand how to build and traverse a reversed trie to efficiently find the longest common suffix between query strings and a container array. Explore how to maintain best candidates based on string length and original index, and apply these techniques to solve real-world suffix matching problems.
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
wordsContainershare 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:
wordsContainer.length, wordsQuery.length...