Search
⌘K
Leetcode 3683. Earliest Time to Finish One Task
Given a list of tasks where each task starts at si and takes ti time, compute the earliest finishing time by returning the minimum value of si + ti across all tasks. This is a simple linear scan to find the smallest finish-time sum.
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.