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

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

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

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

packagecom.fishercoder.solutions;

importjava.util.HashSet;

importjava.util.Set;

publicclass_2351 {

publicstaticclassSolution1 {

publiccharrepeatedCharacter(Strings) {

Set<Character>set =newHashSet<>();

for (charc :s.toCharArray()) {

if (!set.add(c)) {

returnc;

}

}

return' ';

}

}

}