Maximum Population Year

---

Intuition

Complexity

Runtime

Brute force: $O((\text{max\_year}-\text{min\_year})N)$

Space

Code

Brute Force

class Solution:
    def maximumPopulation(self, logs: List[List[int]]) -> int:
        logs.sort()
        earliest_year_with_max_population = logs[0][0]
 
        earliest_year = min(log[0] for log in logs)
        latest_year = max(log[1] for log in logs)
        max_population = -1
 
        for year in range(earliest_year, latest_year):
            population = 0
            for log in logs:
                earliest_year = inf
                if year in range(log[0], log[1]):
                    population += 1
                    earliest_year = min(earliest_year, year)
                    if population > max_population:
                        earliest_year_with_max_population = earliest_year
                        max_population = population
        
        return earliest_year_with_max_population

Notes

Cards

---

References

• Maximum Population Year