Easiest Solution in Java
Code
# Code
```java []
class Solution {
    public int maximumPopulation(int[][] logs) {
        int[] yearFreq = new int[101];
        for(int i=0; i<logs.length; i++){
            for(int j=logs[i][0]; j<logs[i][1]; j++){
                yearFreq[j - 1950]++;
            }
        }

        int max = yearFreq[0], ind = 0;
        for(int i=1; i<101; i++){
            if(yearFreq[i] > max){
                max = yearFreq[i];
                ind = i;
            }
        }
        return ind + 1950;
    }
}
```
['Array', 'Counting', 'Prefix Sum', 'Java']