Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Cohesity
Leetcode 1048. Longest String Chain
Reported Aug 23, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source