Problem Set 3 - Problem 1

[tiagomestreteixeira]

Problem 1 - Is the Word Guessed

Please read the Hangman Introduction before starting this problem.

We'll start by writing 3 simple functions that will help us easily code the Hangman problem.

First, implement the function isWordGuessed that takes in two parameters - a string, secretWord, and a list of letters, lettersGuessed. This function returns a boolean - True if secretWord has been guessed (ie, all the letters of secretWord are in lettersGuessed) and False otherwise.

Example Usage:

>>> secretWord = 'apple' 
>>> lettersGuessed = ['e', 'i', 'k', 'p', 'r', 's']
>>> print(isWordGuessed(secretWord, lettersGuessed))
False

For this function, you may assume that all the letters in secretWord and lettersGuessed are lowercase.

---

Task of #14