Maximum Population Year LeetCode solution in Java

1
class Solution {
2
  public int maximumPopulation(int[][] logs) {
3

4
    int[] year = new int[2051];
5

6
    // O(n) -> n is log.length
7

8
    for (int[] log : logs) {
9

10
      year[log[0]] += 1;
11
      year[log[1]] -= 1;
12
    }
13

14
    int maxNum = year[1950], maxYear = 1950;
15

16
    // O(100) -> 2050 - 1950 = 100
17

18
    for (int i = 1951; i < year.length; i++) {
19
      year[i] += year[i - 1]; // Generating Prefix Sum
20

21
      if (year[i] > maxNum) {
22
        maxNum = year[i];
23
        maxYear = i;
24
      }
25
    }
26

27
    return maxYear;
28
  }
29
}