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

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

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

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

| 2347|[Maximum Number of Pairs in Array](https://leetcode.com/problems/best-poker-hand/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2347.java)|| Easy||

| 2341|[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2341.java)|| Easy||

packagecom.fishercoder.solutions;

importjava.util.TreeSet;

publicclass_2357 {

publicstaticclassSolution1 {

publicintminimumOperations(int[]nums) {

TreeSet<Integer>treeSet =newTreeSet<>();

for (intnum :nums) {

if (num >0) {

treeSet.add(num);

}

}

intops =0;

while (!treeSet.isEmpty()) {

intmin =treeSet.pollFirst();

ops++;

TreeSet<Integer>tmp =newTreeSet<>();

while (!treeSet.isEmpty()) {

tmp.add(treeSet.pollFirst() -min);

}

treeSet.addAll(tmp);

}

returnops;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._2357;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_2357Test {

privatestatic_2357.Solution1solution1;

privatestaticint[]nums;

publicstaticvoidsetup() {

solution1 =new_2357.Solution1();

}

publicvoidtest1() {

nums =newint[]{1,5,0,3,5};

assertEquals(3,solution1.minimumOperations(nums));

}

}