Todos los desafíos
Intermedio 0 resueltos 0% de aceptación

Hidden Word Clue

Build the clue for a word guessing game: exact letters, letters in the wrong spot, and misses.

Lo que aprenderás

  • Compare two strings position by position
  • Use counts to handle repeated letters
  • Build a result string from characters

Problema

Ver traducción

In a classroom word game one player hides a word and the other guesses words of the same length. After each guess the game shows a clue with one character per position:

  • the letter itself if the guess has the right letter in that position;
  • + if the letter is in the hidden word but somewhere else;
  • * if it is not.

Repeated letters are handled by counting: first mark every exact match. The hidden word's letters that were not matched exactly are then available for + marks. Going through the guess from left to right, each non-exact letter takes one available copy of that letter and gets a +; when no copy is left it gets a *.

Implement hidden_word_clue(hidden, guess).

Input

hidden: The hidden word in uppercase letters.

guess: The guess in uppercase letters, the same length as hidden.

Output

Return the clue as a string with the same length as the words.

Restricciones

1 ≤ word length ≤ 20

Both words use only A-Z

Ejemplos

Ejemplo 1
Entrada:
hidden = "PLANT"
guess = "PANEL"

Salida esperada:
expected = "P++*+"
Entrada:
std::string hidden = "PLANT";
std::string guess = "PANEL";

Salida esperada:
std::string expected = "P++*+";
Entrada:
string hidden = "PLANT";
string guess = "PANEL";

Salida esperada:
string expected = "P++*+";

Explicación

P is exact. A, N and L are in PLANT but in other places, and there is no E: P++*+.

Ejemplo 2
Entrada:
hidden = "APPLE"
guess = "PAPPY"

Salida esperada:
expected = "++P**"
Entrada:
std::string hidden = "APPLE";
std::string guess = "PAPPY";

Salida esperada:
std::string expected = "++P**";
Entrada:
string hidden = "APPLE";
string guess = "PAPPY";

Salida esperada:
string expected = "++P**";

Explicación

The middle P (position 3) is exact. One more P is left in APPLE, so the first P gets + and the second extra P gets *. A is elsewhere, Y is missing: ++P**.

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

Do two passes: exact matches first, then the rest.

Pista 2

Count the hidden word's letters that were not exact matches.

Pista 3

A `+` uses up one copy of its letter from those counts.

Complejidad esperada

O(n) time, O(1) extra space

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

Clasificación

Clasificación completa

La mejor solución aprobada de cada programador. Las más rápidas, ligeras y mejor valoradas van primero.

Aún no hay soluciones aprobadas. Resuélvelo y quédate el primer puesto.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.