IPO

Hard

Heap · Greedy · Sorting~25m

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

Suppose LeetCode will start its IPO soon. In order to sell a good price, the company would like to work on at most `k` distinct projects before the IPO. Help the company maximize total capital after finishing at most `k` distinct projects. You are given `n` projects with `profits[i]` and `capital[i]`. Initially, you have `w` capital. When you finish a project, you gain its profit (added to your total capital). Pick a list of at most `k` distinct projects to maximize your final capital, and return the final maximized capital. You can only start a project if your current capital is `≥ capital[i]`.

Example

k = 2, w = 0, profits = [1,2,3], capital = [0,1,1] → 4

Constraints

1 ≤ k ≤ 10⁵ · 0 ≤ w ≤ 10⁹ · n == profits.length == capital.length · 1 ≤ n ≤ 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