Sort the map entries by value and show the smallest key.
Acceptance criteria
- 1.#out should show key a.
DSA Tutorial · Hash Maps and Sets
Practice: When a Hash Map Is the Wrong Choice
These 10 tasks go with the When a Hash Map Is the Wrong Choice chapter. 5 of them ask you to build something small from scratch; 5 give you code that is already broken and ask you to work out why. Set aside about 90 minutes for the whole set, though you can do them in any order.
Nothing here is marked by a person. When you press Submit, the editor checks your code against the points listed under each task and tells you straight away what passed and what didn't (you need a free account to submit). If you get stuck, there are hints, and a worked solution once you've had a go. The first 2 tasks are free; the rest are part of the practice plan.
If it's been a while since you read the chapter, here is how it starts: “Reaching for a Map by reflex is the second most common mistake after nested loops. It is fast at one thing — exact lookup — and unremarkable at everything else.” .