JavaScript Solution
First time of learning about line sweep algorithm. I though it was cool so I am posting a solution in JS even though I did not come up with it.\n\n\nvar maximum
First time of learning about line sweep algorithm. I though it was cool so I am posting a solution in JS even though I did not come up with it.\n\n```\nvar maximumPopulation = function(logs) {\n    const count = new Array(101).fill(0);\n    \n    for (const [birth, death] of logs) {\n        count[birth - 1950]++;\n        count[death - 1950]--;\n    }\n    \n    let max = 0;\n    \n    for (let i = 1; i < 101; i++) {\n        count[i] += count[i - 1];\n        \n        if (count[i] > count[max]) max = i;\n     }\n    \n     return 1950 + max;\n };\n ```
['JavaScript']