Python || 97.44% Faster || O(N) Solution || Hashmap
\nclass Solution:\n    def maximumPopulation(self, logs: List[List[int]]) -> int:\n        a,n=[0]*101,len(logs)\n        for birth,death in logs:\n            
```\nclass Solution:\n    def maximumPopulation(self, logs: List[List[int]]) -> int:\n        a,n=[0]*101,len(logs)\n        for birth,death in logs:\n            a[birth-1950]+=1\n            a[death-1950]-=1\n        c=m=year=0\n        for i in range(101):\n            c+=a[i]\n            if c>m:\n                m=c\n                year=i+1950\n        return year\n```\n\n**An upvote will be encouraging**
['Array', 'Python', 'Python3']