Maximum Performance of a Team

Hard

Heap · Greedy · Sorting~30m

00:00

Section 1Understand Problem

Section 01

Understand the problem

Restate the problem precisely. Interviewers reward candidates who pause, define the contract, and name the guarantees before coding.

Problem statement

You are given two integers `n` and `k` and two integer arrays `speed` and `efficiency` both of length `n` representing the speed and efficiency of `n` engineers respectively. Choose at most `k` different engineers out of the `n` engineers to form a team with the maximum performance. The performance of a team is the sum of their engineers' speeds multiplied by the minimum efficiency among their engineers. Return the maximum performance of this team. Since the answer can be a huge number, return it modulo `10⁹ + 7`.

Example

n = 6, speed = [2,10,3,1,5,8], efficiency = [5,4,3,9,7,2], k = 2 → 60

Constraints

1 ≤ k ≤ n ≤ 10⁵ · speed.length == efficiency.length == n · 1 ≤ speed[i] ≤ 10⁵ · 1 ≤ efficiency[i] ≤ 10⁸

Audio recording unsupported on this browser.

WPM—Fillers0Pace—Thinking0%

Explain the problem in your own words

0 words0 chars

AI Review

Write your thinking above first.

Once you've drafted a response, click Submit for AI review and a senior engineer will critique your reasoning.

Ready to submit Section 1?

The reviewer will check whether you stated inputs, output, guarantees, and any assumption you flagged.

Write at least a couple of sentences explaining the problem before submitting.

AI Interview Prep is optimized for larger screens

Understand the problem