Leetcode 3571. Find the Shortest Superstring II

Given a list of strings, find the shortest string that contains every input string as a substring by ordering and overlapping them optimally. The core challenge is computing pairwise overlaps and choosing a sequence of strings that maximizes total overlap to minimize the resulting superstring length.