Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1665. Minimum Initial Energy to Finish Tasks
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source