Output an Anagram! No Not That One! Given a list of unique strings that are anagrams of each other, output an anagram of those words that is different from each word in the list.
The strings will be alphanumeric, and there is guaranteed to be a valid anagram.
The program or function can, but doesn't have to be non-deterministic, meaning given the same input, multiple running a of the code can yield different outputs, as long as every possible output is a valid one.
Test Cases
[Input] -&gt; Possible output
-----------------
[ab] -&gt; ba
[aba, aab] -&gt; baa
[123, 132, 231, 312, 321] -&gt; 213
[hq999, 9h9q9, 9qh99] -&gt; 999hq
[abcde123, ab3e1cd2, 321edbac, bcda1e23] -&gt; ba213ecd
Python 3, 64 bytes



lambda a:[*{*permutations(a[0])}-{*a}][0]
from itertools import*


Try it online!