Description
Solutions
Find Longest Chain
🔥 FULLTIME

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.

Example 1: 

Input:  words = ["bac", "ac", "a", "c", "bads"]
Output: 3 
Explanation:

      

      The longest chain that can be formed starting with "bac" is "bac" -> "ac" -> "a", which has a length of 3.
Constraints:
    🍓🍓
Thumbnail 0
Testcase
Result
Case 1

input:

output: