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 insert, delete, and getRandom operations, all in average O(1) time. The getRandom method should return a random element from the current set of elements.