Todos os desafios
Médio 0 resolvidos 0% de aceitação

Hidden Word Clue

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

O que você vai aprender

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

Problema

Ver tradução

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.

Restrições

1 ≤ word length ≤ 20

Both words use only A-Z

Exemplos

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

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

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

Saída esperada:
string expected = "P++*+";

Explicação

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

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

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

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

Saída esperada:
string expected = "++P**";

Explicação

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**.

Como abordar

Tente sozinho primeiro e depois abra uma dica de cada vez.

Dica 1

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

Dica 2

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

Dica 3

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

Complexidade esperada

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

Referências

Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.

A melhor solução aprovada de cada programador. As mais rápidas, leves e mais bem avaliadas ficam no topo.

Ainda não há soluções aprovadas. Resolva e fique com o primeiro lugar.

Aprenda com outros

Soluções da comunidade

Ainda não há soluções publicadas. Resolva este desafio para compartilhar a primeira.