Given an array words, where each word consists of lowercase English letters, a word word_A is considered a predecessor of word_B if and only if exactly one letter can be inserted anywhere into word_A (without reordering the remaining characters) to produce word_B.

A word chain is a sequence [word_1, word_2, ..., word_k] where $k \geq 1$, and each word is a predecessor of the next. A single word trivially forms a word chain of length $1$.

Return the length of the longest possible word chain using words chosen from the given words array.

Constraints:

• $1 \leq$ words.length $\leq 10^3$

• $1 \leq$ words[i].length $\leq 16$

• words[i] consists only of lowercase English letters

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.