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

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

| 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||

| 2176|[Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2176.java)||Easy||

packagecom.fishercoder.solutions;

importcom.fishercoder.common.classes.ListNode;

importjava.util.ArrayList;

importjava.util.List;

publicclass_2181 {

publicstaticclassSolution1 {

publicListNodemergeNodes(ListNodehead) {

List<Integer>list =newArrayList<>();

while (head !=null) {

list.add(head.val);

head =head.next;

}

ListNodepre =newListNode(-1);

ListNodetmp =pre;

for (inti =1;i <list.size();i++) {

intsum =0;

while (i <list.size() &&list.get(i) !=0) {

sum +=list.get(i);

i++;

}

tmp.next =newListNode(sum);

tmp =tmp.next;

}

returnpre.next;

}

}

}