Problem · Dynamic Programming
Find Longest Chain
Learn this problemProblem statement
Given a dictionary of many words:
- bac, ac, a, c, bads
For each word, each time you can delete one letter, and the resulting word must still be in the dictionary. The task is to find the longest chain that can be formed.
Function
longestChain(words: String[]) → intExamples
Example 1
words = ["bac", "ac", "a", "c", "bads"]return = 3The longest chain that can be formed starting with "bac" is "bac" -> "ac" -> "a", which has a length of 3.
Constraints
🍓🍓