Topic: Queue Problem / Level: advanced

Problem: Design a data structure that supports the following operations in O(1) time: insert, delete, get random element, and retrieve maximum.

Run the code to see the output here...