Question
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"].
rank_reps(rows: list[str]) → list[str][["ava,500,10","raj,500,12","mia,700,3"]]out["mia,700,3","raj,500,12","ava,500,10"]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.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.