Code Room
CodingEasycod-g1210
Subject Data wranglingLevel Entry–Mid~10 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

A sales log stores one sale per row as "product,region,amount", where amount is an integer. Return the rows (unchanged, in their original order) where the region equals `region` AND the amount is at least `min_amount`. Example: rows ["mug,west,30", "tee,east,50", "cap,west,80"] with region "west" and min_amount 40 give ["cap,west,80"].

Implement
filter_sales(rows: list[str], region: str, min_amount: int) → list[str]
Examples
in[["mug,west,30","tee,east,50","cap,west,80"],"west",40]out["cap,west,80"]
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.

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.

Run or narrate your approach, then ask the coach.