solves count items matching a rule

Author: anishLearnsToCode

README.md

@@ -432,7 +432,7 @@
 | 1758 | [Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string)                      |                                                   [![Java](assets/java.png)](src/MinimumChangesToMakeAlternatingBinaryString.java)                                                   |                                                                                                                                   |
 | 1763 | [Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring)                                                                            |                                                              [![Java](assets/java.png)](src/LongestNiceSubstring.java)                                                               |                                                                                                                                   |
 | 1768 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately)                                                                      |                                                             [![Java](assets/java.png)](src/MergeStringsAlternately.java)                                                             |                                                                                                                                   |
-| 1773 | [Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule)                                                                  |                                                                                                                                                                                      |                                                                                                                                   |
+| 1773 | [Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule)                                                                  |                                                             [![Java](assets/java.png)](src/CountItemsMatchingARule.java)                                                             |                                                                                                                                   |
 | 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal)                          |                                                                                                                                                                                      |                                                                                                                                   |

src/CountItemsMatchingARule.java

@@ -0,0 +1,24 @@
+import java.util.List;
+
+public class CountItemsMatchingARule {
+    public int countMatches(List<List<String>> items, String ruleKey, String ruleValue) {
+        return countMatches(items, getRuleIndex(ruleKey), ruleValue);
+    }
+
+    private int countMatches(List<List<String>> items, int ruleIndex, String ruleValue) {
+        int matches = 0;
+        for (List<String> item : items) {
+            if (item.get(ruleIndex).equals(ruleValue)) matches++;
+        }
+        return matches;
+    }
+
+    private int getRuleIndex(String key) {
+        return switch (key) {
+            case "type" -> 0;
+            case "color" -> 1;
+            case "name" -> 2;
+            default -> -1;
+        };
+    }
+}