Easiest SOlution Ever
\nclass Solution\n{\n    public int maximumPopulation(int[][] logs) \n    {\n        int[] ans = new int[2050];\n        for(int[] log : logs)\n        {\n     
```\nclass Solution\n{\n    public int maximumPopulation(int[][] logs) \n    {\n        int[] ans = new int[2050];\n        for(int[] log : logs)\n        {\n            ans[log[0] - 1950] += 1;\n            ans[log[1] - 1950] -= 1;\n        }\n        int max_pop=0;\n        int max_pop_idx=0;\n        int population=0;\n        for(int i=0;i<ans.length;i++)\n        {\n            population += ans[i];\n            if(population > max_pop)\n            {\n                max_pop = population;\n                max_pop_idx = i;\n            }\n        }\n        return (1950 + max_pop_idx);\n    }\n}\n```
[]