Problem: Count Items Matching a Rule
Understand how to implement a linear search algorithm that counts how many items in a list meet a specific rule based on type, color, or name. This lesson guides you through mapping rule keys to indices and iterating with optimized O(n) time complexity, helping you confidently apply searching techniques to array data.
We'll cover the following...
Statement
You are given an array items, where each items[i] = [type_i, color_i, name_i] represents the type, color, and name of the ruleKey and ruleValue, that together define a matching rule.
An item is considered a match if any of the following conditions holds:
ruleKey == "type"andruleValue == type_iruleKey == "color"andruleValue == color_iruleKey == "name"andruleValue == name_i
Return the total number of items in items that match the given rule.
Constraints:
...