Skip to content

Practice Rings and Rods

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#2103
LeetCode Problem

Rings and Rods

Problem Statement

There are n rings and each ring is either red, green, or blue. The rings are distributed across ten rods labeled from 0 to 9. You are given a string rings of length 2n that describes the n rings that are placed onto the rods. Every two characters in rings forms a color-position pair that is used to describe each ring where: For example, "R3G2B1" describes n == 3 rings: a red ring placed onto the rod labeled 3, a green ring placed onto the rod labeled 2, and a blue ring placed onto the rod labeled 1. Return the number of rods that have all three colors of rings on them.

Source: Rings and Rods on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
rings = "B0B6G0R6R0R6G9"
Output
1

# Example 2

Input
rings = "B0R0G0R9R0B0G0"
Output
1

# Example 3

Input
rings = "G4"
Output
0

Constraints

rings.length == 2 * n
1 <= n <= 100
rings[i] where i is even is either 'R', 'G', or 'B' (0-indexed).
rings[i] where i is odd is a digit from '0' to '9' (0-indexed).

Related LeetCode Problems

Practice more problems similar to Rings and Rods.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.