OPEN AI NEW GRAD SWE OA Q4

Question 4 — Lowest Cost Shirts
Objective
Suppose there is a sale on blue, green, and red shirts for the next

1. n

复制代码

days.
On day

1. i

复制代码

, it costs \(b_i\) dollars to buy a blue shirt, \(g_i\) dollars to buy a green shirt, and \(r_i\) dollars to buy a red shirt.
You wish to buy a single shirt for each of the next

1. n

复制代码

days, but with the caveat that you cannot buy the same color shirt on consecutive days.
Implementation

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

3
For inputs:

1. blue_costs  = [100, 1, 76, 14]green_costs = [22, 20, 1, 2]red_costs   = [99, 99, 5, 12]

复制代码

the output list should be:

1. ['g', 'b', 'r', 'g']

复制代码

with a total cost of 30.

Limits

• Available RAM: 512MB Timeout: 6 seconds
• The program has to read inputs from standard input.
• The prm has to write the solution to standard output.

fu. ua3