95% beats in memory. Very easy solution using only for loop.
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int countMatches(List<List<String>> items, String ruleKey, String ruleValue) {\n        int count = 0;\n        for(List<String> s : items) {\n            switch(ruleKey) {\n                case "type" -> {\n                    count += s.get(0).equals(ruleValue) ? 1 : 0;\n                }\n                case "color" -> {\n                    count += s.get(1).equals(ruleValue) ? 1 : 0;\n                }\n                case "name" -> {\n                    count += s.get(2).equals(ruleValue) ? 1 : 0;\n                }\n            }\n        }\n        return count;\n    }\n}\n```
['Java']