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

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

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

| 2335|[Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2335.java)|| Easy||

| 2331|[Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2331.java)|| Easy||

| 2326|[Spiral Matrix IV](https://leetcode.com/problems/spiral-matrix-iv/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2326.java)|| Medium||

packagecom.fishercoder.solutions;

importjava.util.HashMap;

importjava.util.Map;

publicclass_2341 {

publicstaticclassSolution1 {

publicint[]numberOfPairs(int[]nums) {

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

for (intnum :nums) {

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

}

intpairs =0;

intleftover =0;

for (intkey :map.keySet()) {

if (map.get(key) >1) {

pairs +=map.get(key) /2;

leftover +=map.get(key) %2;

}else {

leftover++;

}

}

returnnewint[]{pairs,leftover};

}

}

}