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

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

| 2363|[Merge Similar Items](https://leetcode.com/problems/merge-similar-items/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2363.java)|| Easy||

| 2357|[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2357.java)|| Easy||

| 2352|[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2352.java)|| Medium||

| 2351|[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2351.java)|| Easy||

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.Arrays;

importjava.util.List;

importjava.util.TreeMap;

publicclass_2363 {

publicstaticclassSolution1 {

publicList<List<Integer>>mergeSimilarItems(int[][]items1,int[][]items2) {

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

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

for (int[]item :items1) {

map.put(item[0],map.getOrDefault(item[0],0) +item[1]);

}

for (int[]item :items2) {

map.put(item[0],map.getOrDefault(item[0],0) +item[1]);

}

for (intkey :map.keySet()) {

result.add(newArrayList<>(Arrays.asList(key,map.get(key))));

}

returnresult;

}

}

}