Available question text
Given up to 12 unique words, produce the shortest string that contains each word as a substring by choosing an ordering that maximizes pairwise overlaps—an NP-hard superstring problem that, with n ≤ 12, reduces to a TSP-like optimization solvable via bitmask DP over overlaps.
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 943. Find the Shortest Superstring
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source