You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

You're given a string and need to repeatedly remove adjacent, identical characters until no more duplicates exist. Return the final string after all such removals.

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.