The High Rollers

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 wager dicts (each with a 'user' key and an 'amount' key) and a threshold (a percentile in the range 0..100), sum each user's total amount. Compute the threshold-th percentile of the per-user totals using linear interpolation between the two closest ranks (the numpy/'linear' convention): sort the totals, let rank = threshold/100 * (n - 1) over the n unique users, and interpolate between sorted_totals[floor(rank)] and sorted_totals[floor(rank)+1] by the fractional part. Return the alphabetically sorted list of usernames whose total is STRICTLY greater than that cutoff. With threshold 0.01 the cutoff sits just above the smallest total, so only users above the very bottom qualify.

Summary

Not every gambler bets the same - some wager far more than others.

Practice This Problem

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