The Pay Ladder

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

Domain

Python

Difficulty

medium

Seniority

L4

Problem

Given a list of employee dicts (each with a 'salary' key) and integer n, return the top n distinct salaries in descending order. Do NOT use sorted(), sort(), nlargest, or any similar sort helpers - implement the selection yourself. If fewer than n distinct salaries exist, return all of them.

Summary

Climb the ladder the hard way. No shortcuts allowed.

Practice This Problem

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