You are given a two dimensional integer array logs where each logs[i] = [birth_i, death_i] indicates the birth and death years of the $i^{ ext{th}}$ person.

The population of a given year is the total number of people alive during that year. A person is considered alive during every year in the inclusive range from birth_i to death_i $- 1$.

Return the earliest year that achieves the maximum population.

Note: A person is not considered alive in their death year death_i.

Constraints:

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

• $1950 \leq$ birth_i $<$ death_i $\leq 2050$

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.