Question
Implement an inner equi-join. `users` is a list of dicts with keys 'id' and 'name'; `orders` is a list of dicts with keys 'user_id' and 'total'. Return a list of [name, total] pairs, one per order whose 'user_id' matches some user 'id'. Multiple users may share an id (treat them all as matches). Preserve the order of `orders`, and within a single order break ties by ascending user 'name'. Ids are ints; names are strings.
inner_join(users: list[dict], orders: list[dict]) → list[list][[{"id":1,"name":"ann"},{"id":2,"name":"bob"}],[{"total":50,"user_id":2},{"total":30,"user_id":1},{"total":99,"user_id":9}]]out[["bob",50],["ann",30]]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.