You are given an array items, where each items[i] = [type_i, color_i, name_i] describes the type, color, and name of the $i^{ th}$ item. You are also given two strings, ruleKey and ruleValue.

The $i^ {th}$ item is considered a match to the rule if one of the following conditions is satisfied:
• ruleKey == "type" and ruleValue == type_i
• ruleKey == "color" and ruleValue == color_i
• ruleKey == "name" and ruleValue == name_i

Return the total count of items that match the specified rule.

Constraints:

• $1 \le$ items.length $\le 10^4$

• $1 \le$ type_i.length, color_i.length, name_i.length, ruleValue.length $\le 10$

• ruleKey is equal to either "type", "color", or "name".

• All strings consist only of lowercase letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.