Suppose you’re given a string
s that consists of lowercase alphabetic letters only. The length of the sentence is
n. You are given
n cards, which has lowercase alphabetic letters on the front and back. You want to arrange (shuffle and/or flip each card) the
n cards in the order that produces the sentence. You can use 1 of 2 sides of a card, but obviously not both.
I am wondering if this problem can be converted to a Hungarian Algorithm problem? We essentially have a bipartite here. The left graph consists of
n nodes represent each character in
s. For each character in
s, there is a subset of the
n cards that can can be used to create that character.
Can this be turned into a problem that can be solved with the Hungarian algo?