Code RoomFilter sales log
EasyPrep Room Coding #389

Filter sales log

CodingAlgorithms & data structuresEntry–Mid~10 min

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.

0:00 of about 10 min
InputExpectedGot
[["mug,west,30","tee,east,50","cap,west,80"],"west",40]["cap,west,80"]not run yetsample