Problem 3435 · Hard

Frequencies of Shortest Supersequences

Every word has two letters. Find the shortest strings that contain all the words as subsequences, treat strings that are rearrangements of each other as one, and return a 26-entry letter count for each distinct result.

Open the interactive visualisation