Top N Keys

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L3

Problem

Given a dict mapping keys to numeric values and an integer n, return the n keys with the largest values, sorted by value descending, tie-break alphabetically by key. If fewer than n keys exist, return all of them.

Summary

Most of them do not matter. The few that do stand out.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.