Leetcode 1048. Longest String Chain
Given a list of words, find the length of the longest chain where each next word is formed by inserting exactly one letter into the previous word (order of other characters preserved). This is solved by viewing words as nodes in a DAG ordered by length and using dynamic programming (or longest-path in DAG) to compute the maximum chain length.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.