CodingHardcod-g790

Subject Priority queuesLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

You have n engineers each with a speed and an efficiency. Pick at most k of them to form a team. The team's performance is (sum of chosen speeds) multiplied by (the minimum efficiency among the chosen). Return the maximum possible performance. (No modulo — values are small enough.) 1 <= k <= n.

Implement

max_performance(speed: list[int], efficiency: list[int], k: int) → int

Examples

in[[2,10,3,1,5,8],[5,4,3,9,7,2],2]out60

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.