Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms in Java

Problem: Count Items Matching a Rule

Explore how to implement a linear search to count items matching a specific rule based on type, color, or name in Java. This lesson helps you understand effective string comparison and iteration techniques to solve real-world filtering problems efficiently.

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 ithi^{th} item. You are also given two strings, ruleKey and ruleValue, that together define a matching rule.

An item is considered a match if any of the following conditions holds:

  • ruleKey == "type" and ruleValue == type_i

  • ruleKey == "color" and ruleValue == color_i

  • ruleKey == "name" and ruleValue == name_i

Return the total number of items in items that match the given rule.

Constraints: ...