Implement Hangman With Limited Guesses | Dataford Interview Questions

Hangman implementation with a limited number of guesses.

Implement a function that processes guesses in order. Correct guesses reveal matching letters, repeated guesses have no effect, and incorrect guesses reduce the remaining guess count. Return won when every character is revealed. If the guess limit is reached first, return lost and mask only the first character in the returned pattern while revealing the remaining characters.

Input and Output

Use the signature def hangman(word, guesses, max_guesses):. Return a dictionary with status, pattern, and remaining_guesses.

Constraints

word contains at least one lowercase English letter
Each guesses item is one lowercase English letter
0 <= max_guesses <= 10^5
Repeated guesses do not consume attempts
Processing stops immediately when the word is won or the guess limit is reached

Function Signature

def hangman(word, guesses, max_guesses):

Your question is Implement Hangman With Limited Guesses. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem