using simple map clear code Best solution
class Solution {\npublic:\n    int maximumPopulation(vector>& logs) {\n        \n        map mp;\n        for(int i = 0;i<logs.size();i++){\n            \n     
class Solution {\npublic:\n    int maximumPopulation(vector<vector<int>>& logs) {\n        \n        map<int,int> mp;\n        for(int i = 0;i<logs.size();i++){\n            \n            int b = logs[i][0];\n            int d = logs[i][1];\n            for(int j = b;j<d;j++){\n                mp[j]++;\n            }\n        }\n        int ans = 1950;\n        int mx = 0;\n        for(auto i : mp){\n            if(i.second>mx){\n                mx = i.second;\n                ans = i.first;\n            }\n        }\n        \n        cout<<ans;\n        return ans;\n    }\n};
['C']