Easy Solution | 1ms | Java
1msCode
# 1ms


# Code
```java []
class Solution {
    public int maximumPopulation(int[][] logs) {
        int[] arr = new int[101];
        for(int[] l: logs){
            int birth = l[0];
            int death = l[1];
            arr[birth - 1950]++;
            arr[death - 1950]--;

        }

        int max = arr[0];
        int year = 1950;

        for(int i =1; i< arr.length; i++){
            arr[i] = arr[i - 1] + arr[i];
            if(arr[i] > max){
                max = arr[i];
                year = 1950 + i;
            }
        }
        return year;
    }
}
```
['Java']