Simple Solution in C...Beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nint maximumPopulation(int** logs, int n, int* logsColSize) {\n    int *freq=(int*)malloc(101*sizeof(int));\n    for(int i=0;i<100;i++)freq[i]=0;\n    for(int i=0;i<n;i++){\n        int birth=logs[i][0],death=logs[i][1];\n        while(birth<death){\n            freq[birth-1950]++;\n            birth++;\n        }\n    }\n    int max=0,ans=0;\n    for(int i=0;i<=100;i++){\n        if(max<freq[i]){\n            max=freq[i];\n            ans=i;\n        }\n    }\n    free(freq);\n    return 1950+ans;\n}\n```
['C']