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

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

|2103|[Rings and Rods](https://leetcode.com/problems/rings-and-rods/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2103.java)||Easy||

|2099|[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2099.java)||Easy||

|2095|[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2095.java)||Medium||

|2094|[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2094.java)||Easy||

packagecom.fishercoder.solutions;

importjava.util.HashMap;

importjava.util.HashSet;

importjava.util.Map;

importjava.util.Set;

publicclass_2103 {

publicstaticclassSolution1 {

publicintcountPoints(Stringrings) {

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

for (inti =0;i <rings.length() -1;i +=2) {

charcolor =rings.charAt(i);

intpos =Character.getNumericValue(rings.charAt(i +1));

Set<Integer>set =map.getOrDefault(pos,newHashSet<>());

if (color =='R') {

set.add(1);

}elseif (color =='G') {

set.add(2);

}else {

set.add(3);

}

map.put(pos,set);

}

intans =0;

for (intpos :map.keySet()) {

if (map.get(pos).size() ==3) {

ans++;

}

}

returnans;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._2103;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_2103Test {

privatestatic_2103.Solution1solution1;

privatestaticintexpected;

publicstaticvoidsetup() {

solution1 =new_2103.Solution1();

}

publicvoidtest1() {

expected =1;

assertEquals(expected,solution1.countPoints("B0B6G0R6R0R6G9"));

}

}