Simple java solution
class Solution {\n\n    public int maximumPopulation(int[][] l) {\n        int a[]=new int[151];\n        int k=l.length;\n        for(int i=0;i<k;i++)\n       
class Solution {\n\n    public int maximumPopulation(int[][] l) {\n        int a[]=new int[151];\n        int k=l.length;\n        for(int i=0;i<k;i++)\n        {\n            for(int j=l[i][0];j<l[i][1];j++)\n            {\n                a[j-1950]++;\n            }\n        }\n        int s=Integer.MIN_VALUE,p=0;\n        for(int i=0;i<151;i++)\n        {\n            if(a[i]>s)\n            {\n                s=a[i];\n                p=i+1950;\n            }\n        }\n        return p;\n    }\n}
['Java']