There are n employees, each assigned a unique identifier from $0$ to n $- 1$.

You are given a $2$D integer array logs where each element logs[i] = [id$_i$, leaveTime$_i$] indicates that the employee with identifier id$_i$ worked on the $i^{ ext{th}}$ task and finished it at time leaveTime$_i$.

The $0^{ ext{th}}$ task starts at time $0$, and every subsequent task $i$ begins immediately when the previous task $i - 1$ ends at leaveTime$_{i-1}$. The duration of each task is the total time spent working on it.

Return the identifier of the employee who worked on the task with the longest duration. If there is a tie, return the smallest employee identifier among them.

Constraints:

• $2 \leq$ n $\leq 500$

• $1 \leq$ logs.length $\leq 500$

• logs[i].length $= 2$

• $0 \leq$ id$_i \leq$ n $- 1$

• $1 \leq$ leaveTime$_i \leq 500$

• id$_i \neq$ id$_{i+1}$

• leaveTime$_i$ values are sorted in strictly increasing order.

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.