# ============================================================
# Problem 1: 1D Herdle (Basic)
# 
# Given two strings: 'answer' and 'guess'.
#
# Rules:
# - Same position + Same character -> Green
# - Different position + Same character -> Yellow
# - "Count matches" only up to the available characters.
#
# 👉 Requirement: Use the remove() method.
#
# Input:
# ABC
# CAA
#
# Output:
# 0
# 2
# ============================================================

# Write your code below

# ============================================================
# Problem 2: Core Logic (Handling Duplicates)
#
# Accuracy is key when a character appears multiple times.
#
# 👉 Pro-tip: Using remove() prevents counting the same 
#             character twice!
#
# Input:
# AAB
# AAA
#
# Output:
# 1
# 1
# ============================================================

# Write your code below
# ============================================================
# Problem 3: 3x3 Herdle (Real USACO Style)
#
# Given two 3x3 grids.
#
# Rules:
# - Same position + Same character -> Green
# - Different position + Same character -> Yellow
# - Limited counts: A character can only be Yellow 
#   as many times as it remains in the answer.
#
# 👉 Order of Operations:
# 1. Process 'Green' first and remove them.
# 2. Process 'Yellow' with the remaining characters.
#
# Input:
# ABC
# DEF
# GHI
# AEC
# DBF
# XYZ
#
# Output:
# 3
# 2
# ============================================================

# Write your code below