| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1854|[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1854.java)||Easy|Array|

|1848|[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1848.java)||Easy|Array|

|1845|[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1845.java)||Medium|Heap, Design|

|1844|[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java)||Easy|String|

packagecom.fishercoder.solutions;

importjava.util.TreeMap;

publicclass_1854 {

publicstaticclassSolution1 {

publicintmaximumPopulation(int[][]logs) {

TreeMap<Integer,Integer>map =newTreeMap<>();

for (int[]log :logs) {

for (intstart =log[0];start <log[1];start++) {

map.put(start,map.getOrDefault(start,0) +1);

}

}

intmaxPop =0;

intmaxPopYear =0;

for (intyear :map.keySet()) {

if (map.get(year) >maxPop) {

maxPop =map.get(year);

maxPopYear =year;

}

}

returnmaxPopYear;

}

}

}