Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1665. Minimum Initial Energy to Finish Tasks
Given tasks specified by (actual, minimum) energy where you must have at least minimum energy to start a task and then lose actual energy, find the smallest initial energy that allows completing all tasks in some order. The core challenge is choosing an order (greedy/sorting) that minimizes the required starting resource under constraints up to 1e5 tasks.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.