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

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

| 2182|[Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2182.java)||Medium||

| 2181|[Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2181.java)||Medium||

| 2180|[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2180.java)||Easy||

| 2177|[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2177.java)||Medium||

packagecom.fishercoder.solutions;

importjava.util.HashMap;

importjava.util.Map;

importjava.util.PriorityQueue;

publicclass_2182 {

publicstaticclassSolution1 {

publicStringrepeatLimitedString(Strings,intrepeatLimit) {

Map<Character,Integer>map =newHashMap<>();

for (charc :s.toCharArray()) {

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

}

PriorityQueue<Count>heap =newPriorityQueue<Count>((a,b) ->b.c -a.c);

for (charc :map.keySet()) {

heap.offer(newCount(c,map.get(c)));

}

StringBuildersb =newStringBuilder();

while (!heap.isEmpty()) {

Countcurr =heap.poll();

intnum =Math.min(curr.num,repeatLimit);

while (num >0) {

sb.append(curr.c);

num--;

}

if (curr.num >repeatLimit) {

CountnewCount =newCount(curr.c,curr.num -repeatLimit);

if (!heap.isEmpty()) {

Countnext =heap.poll();

sb.append(next.c);

if (next.num >1) {

heap.offer(newCount(next.c,next.num -1));

}

}else {

break;

}

heap.offer(newCount);

}

}

returnsb.toString();

}

classCount {

charc;

intnum;

publicCount(charc,Integerinteger) {

this.c =c;

this.num =integer;

}

}

}

}