Top-N customers by spend, tie-broken by name

Given a dict like {"alice": 250, "bob": 180, "carol": 250} mapping customer name → total spend, return the top n customers as a list of (name, spend) tuples in DESCENDING order of spend.

Ties on spend break ALPHABETICALLY by name (ascending). If n is larger than the dict, return everything.

What the tests check

5 on Run · 6 on Submit

01empty input returns empty list

02returns the requested number when no ties

03breaks ties alphabetically ascending

04tie-break is by name, not by the order names appear in the input

05n larger than dict returns everything

Submit runs these and one more check you don’t see, so code written for the visible tests alone can still miss.

Runtime

Python 3.13 in your browser – the standard library plus pandas and numpy; no pip installs.

If you get stuck

Show hint · 1 hint Walkthrough Reveal answer

Your code · runs in your browser⌘ Enter to run the tests

Loading editor…

Output · run to see the tests