Available question text
Given a set of 2-letter words (bigrams) over ≤16 distinct letters, each bigram imposes a precedence constraint (a must appear before b) and the task is to find all shortest strings that satisfy every constraint (cycles may force repeated letters) and return the unique letter-frequency vectors for those shortest common supersequences, ignoring sequences that are permutations of each other.
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
No company association
Leetcode 3435. Frequencies of Shortest Supersequences
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source