Guess The Word Problem
Description
LeetCode Problem 843.
This is an interactive problem.
You are given an array of unique strings wordlist where wordlist[i] is 6 letters long, and one word in this list is chosen as secret.
You may call Master.guess(word) to guess a word. The guessed word should have type string and must be from the original list with 6 lowercase letters.
This function returns an integer type, representing the number of exact matches (value and position) of your guess to the secret word. Also, if your guess is not in the given wordlist, it will return -1 instead.
For each test case, you have exactly 10 guesses to guess the word. At the end of any number of calls, if you have made 10 or fewer calls to Master.guess and at least one of these guesses was secret, then you pass the test case.
Example 1:
1
2
3
4
5
6
7
8
9
Input: secret = "acckzz", wordlist = ["acckzz","ccbazz","eiowzz","abcczz"], numguesses = 10
Output: You guessed the secret word correctly.
Explanation:
master.guess("aaaaaa") returns -1, because "aaaaaa" is not in wordlist.
master.guess("acckzz") returns 6, because "acckzz" is secret and has all 6 matches.
master.guess("ccbazz") returns 3, because "ccbazz" has 3 matches.
master.guess("eiowzz") returns 2, because "eiowzz" has 2 matches.
master.guess("abcczz") returns 4, because "abcczz" has 4 matches.
We made 5 calls to master.guess and one of them was the secret, so we pass the test case.
Example 2:
1
2
Input: secret = "hamada", wordlist = ["hamada","khaled"], numguesses = 10
Output: You guessed the secret word correctly.
Constraints:
- 1 <= wordlist.length <= 100
- wordlist[i].length == 6
- wordlist[i] consist of lowercase English letters.
- All the strings of wordlist are unique.
- secret exists in wordlist.
- numguesses == 10
Sample C++ Code
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/**
* // This is the Master's API interface.
* // You should not implement it, or speculate about its implementation
* class Master {
* public:
* int guess(string word);
* };
*/
class Solution {
public:
int check(string &a, string &b) {
int ct = 0;
for (int i = 0 ; i < 6 ; i++)
if (a[i] == b[i])
ct++;
return ct;
}
void findSecretWord(vector<string>& words, Master& master) {
for (int i = 0, matches = 0; i < 30 and matches != 6 ; i++) {
// since we have to pick a random word for each iteration
string trial = words[words.size()/2] ;
matches = master.guess(trial);
vector<string> possibilities;
for (auto word: words) {
if (check(word, trial) == matches)
possibilities.push_back(word);
}
words = possibilities;
}
}
};