Code RoomRank sales reps
MediumPrep Room Coding #405

Rank sales reps

CodingAlgorithms & data structuresEntry–Mid~15 min

A sales dashboard ranks reps for the quarter. Each row is "name,revenue,deals" (revenue and deals are non-negative integers; names are distinct). Return the rows reordered: revenue descending, then deals descending as the first tiebreak, then name ascending as the final tiebreak. Example: ["ava,500,10", "raj,500,12", "mia,700,3"] gives ["mia,700,3", "raj,500,12", "ava,500,10"].

Implement
rank_reps(rows: list[str]) → list[str]
Examples
in[["ava,500,10","raj,500,12","mia,700,3"]]out["mia,700,3","raj,500,12","ava,500,10"]
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 15 min
InputExpectedGot
[["ava,500,10","raj,500,12","mia,700,3"]]["mia,700,3","raj,500,12","ava,500,10"]not run yetsample