Longest Common Suffix Queries

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 \leq$ wordsContainer.length, wordsQuery.length $\leq 10^4$ ...