Find the shortest string that is not a substring of any string within a given array of strings. Return this shortest uncommon substring.

Design a data structure that supports insertion, deletion, and random element retrieval, all in constant time on average. You'll need to handle edge cases carefully to achieve O(1) complexity.

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.