The Numbered Chair

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

Domain

Python

Difficulty

easy

Seniority

L3

Problem

Given a dict mapping player names to scores, return the player name at the n-th position when sorted by score descending (tie-break by player name ascending). n is 1-based. If n exceeds the number of players, return None.

Summary

A standing list. Position n holds one entry.

Practice This Problem

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