Practice Longest String Chain
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Longest String Chain
Problem Statement
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 [word1, word2, ..., wordk] with k >= 1, where word1 is a predecessor of word2, word2 is a predecessor of word3, and so on. A single word is trivially a word chain with k == 1. Return the length of the longest possible word chain with words chosen from the given list of words.
Source: Longest String Chain on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
words = ["a","b","ba","bca","bda","bdca"]
4
# Example 2
words = ["xbc","pcxbcf","xb","cxbc","pcxbc"]
5
# Example 3
words = ["abcd","dbqca"]
1
Constraints
Related LeetCode Problems
Practice more problems similar to Longest String Chain.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.