Cheapest quotes
Two suppliers quote prices for the same catalogue: two lists of equal length, where position i in each list is the quote for product i. Build the cheapest possible order sheet by taking, for every product, the lower of the two quotes (either one when they tie). Return the resulting list. Example: [5, 2, 9] and [4, 6, 1] give [4, 2, 1].
Implement
cheapest_quotes(a: list[int], b: list[int]) → list[int]Examples
in
[[5,2,9],[4,6,1]]out[4,2,1]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
solution.py
InputExpectedGot
[[5,2,9],[4,6,1]][4,2,1]not run yetsample