3683. Earliest Time to Finish One Task

LeetCodeArrayOpen on judge ↗

You are given a 2D integer array tasks where tasks[i] = [si, ti]. Each [si, ti] in tasks represents a task with start time si that takes ti units of time to finish. Return the earliest time at which at least one task is finished. Example 1: Input: tasks = [[1,6],[2,3]] Output: 5 Explanation: The first task starts at time t = 1 and finishes at time 1 + 6 = 7. The second task finishes at ti

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI