You are given a two dimensional integer array tasks, where tasks[i] = [s_i, t_i] represents a task that begins at time s_i and requires t_i units of time to complete.

Each task finishes at time s_i $+$ t_i.

Return the earliest time at which at least one task is completed.

Constraints:

• $1 \leq$ tasks.length $\leq 100$

• tasks[i] = [s_i, t_i]

• $1 \leq$ s_i, t_i $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.