Given a stream of characters, at any time find and remove the character that has the maximum occurrence so far. Design a data structure and algorithm for this, and optimize log(n) heap operations to…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.