Longest String Chain

You are given an array of `words` where each word consists of lowercase English letters. `wordA` is a predecessor of `wordB` if and only if we can insert exactly one letter anywhere in `wordA` without changing the order of the other characters to make it equal to `wordB`. A word chain is a sequence of words `[word_1, word_2, ..., word_k]` with `k >= 1`, where `word_1` is a predecessor of `word_2`, `word_2` is a predecessor of `word_3`, and so on. Return the length of the longest possible word chain with words chosen from the given list of `words`. ### Constraints - `1 <= words.length <= 1000` - `1 <= words[i].length <= 16` - All words consist of lowercase English letters. ### Input Format A single line containing space-separated words. ### Output Format Print the length of the longest possible word chain.