Generate Per-Position Guess Feedback

Problem Description

You are building the core engine for a word-guessing game. Given a secret word and a guess word of the same length, determine the feedback for each position in the guess.

The feedback for each position should be one of the following:

• 'G' (Green): The character at this position in guess exactly matches the character at the same position in secret.
• 'Y' (Yellow): The character at this position in guess exists in secret, but not at the current position, and has not been "used up" by a 'G' or another 'Y' elsewhere.
• 'X' (Gray): The character at this position in guess does not exist in secret (or all instances of this character in secret have already been accounted for).

Function Signature

def get_guess_feedback(secret: str, guess: str) -> str:

Examples

# Example 1
secret = "APPLE"
guess = "PLIER"
# Output: "XYYYX"
# P (idx 1) is Y (exists at index 1 in secret), L (idx 2) is Y, I (idx 3) is Y, E (idx 4) is Y.

# Example 2
secret = "ABCDE"
guess = "EDCBA"
# Output: "YYXYY"

# Example 3
secret = "SPEED"
guess = "DEEPS"
# Output: "YYXYY"

Constraints

• len(secret) == len(guess)
• 1 <= len(secret) <= 1000
• Inputs consist of uppercase English letters.

Edge Cases

• The words are identical.
• All characters in guess are absent from secret.
• The words have repeating characters (e.g., secret has two 'E's, but guess has three).