Showing 3 of 26 questions
You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.
#1. Merge Intervals
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.
#2. Remove All Adjacent Duplicates In String
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.
#3. Insert Delete GetRandom O(1)
Page 1 of 1 · 26 total