Daily Coding Problem: Problem #1196 [Hard]

Good morning! Here's your coding interview problem for today.

This problem was asked by Dropbox.

Create a data structure that performs all the following operations in O(1) time:

• plus: Add a key with value 1. If the key already exists, increment its value by one.
• minus: Decrement the value of a key. If the key's value is currently 1, remove it.
• get_max: Return a key with the highest value.
• get_min: Return a key with the lowest value.

Upgrade to premium and get in-depth solutions to every problem, including this one. Since you were referred by one of our affiliates, you'll get a 10% discount on checkout!

If you liked this problem, feel free to forward it along so they can subscribe here! As always, shoot us an email if there's anything we can help with!

Practice makes perfect. Book a mock interview with a FAANG-level interviewer today from our friends at Exponent (10% off!).

System design interviews are becoming more popular in SWE interviews. Here's how to prepare.

No more? Snooze or unsubscribe.