All challenges
Medium 0 solved 0% acceptance

Hidden Word Clue

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

What you'll learn

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

Problem

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.

Constraints

1 ≤ word length ≤ 20

Both words use only A-Z

Examples

Example 1
Input:
hidden = "PLANT"
guess = "PANEL"

Expected output:
expected = "P++*+"
Input:
std::string hidden = "PLANT";
std::string guess = "PANEL";

Expected output:
std::string expected = "P++*+";
Input:
string hidden = "PLANT";
string guess = "PANEL";

Expected output:
string expected = "P++*+";

Explanation

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

Example 2
Input:
hidden = "APPLE"
guess = "PAPPY"

Expected output:
expected = "++P**"
Input:
std::string hidden = "APPLE";
std::string guess = "PAPPY";

Expected output:
std::string expected = "++P**";
Input:
string hidden = "APPLE";
string guess = "PAPPY";

Expected output:
string expected = "++P**";

Explanation

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

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

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

Hint 2

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

Hint 3

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

Expected complexity

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

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.