CodingEasycod-g1200

Subject ArraysLevel Entry–Mid~10 minCommon in Databases & SQL · Algorithms & data structures interviewsIndustries Software development

Question

A dispatch queue estimates its total waiting cost. The order at the front (position 0) waits 0 slots, the next waits 1 slot, and so on. Each order's cost is its value multiplied by how many slots it waits. Given the order values in queue order, return the total cost. Example: [5, 3, 7] gives 5*0 + 3*1 + 7*2 = 17.

Implement

queue_wait_cost(values: list[int]) → int

Examples

in[[5,3,7]]out17

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.

Learn the concepts

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.