Formatted question description: https://leetcode.ca/all/843.html

# 843. Guess the Word (Hard)

This problem is an interactive problem new to the LeetCode platform.

We are given a word list of unique words, each word 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 10 guesses to guess the word. At the end of any number of calls, if you have made 10 or less calls to master.guess and at least one of these guesses was the secret, you pass the testcase.

Besides the example test case below, there will be 5 additional test cases, each with 100 words in the word list.  The letters of each word in those testcases were chosen independently at random from 'a' to 'z', such that every word in the given word lists is unique.

Example 1:
Input: secret = "acckzz", wordlist = ["acckzz","ccbazz","eiowzz","abcczz"]

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.


Note:  Any solutions that attempt to circumvent the judge will result in disqualification.

Related Topics:
Minimax

## Solution 1.

Make a random guess w. Assume the result is cnt.

The secret must be among those which have cnt matches with w. So filter the wordList to these words.

Keep redoing these, you’ll find the secret.

// OJ: https://leetcode.com/problems/guess-the-word/

// Time: O(N)
// Space: O(1)
class Solution {
int countSame(string &a, string &b) {
int cnt = 0;
for (int i = 0; i < 6; ++i) cnt += a[i] == b[i];
return cnt;
}
public:
void findSecretWord(vector<string>& A, Master& master) {
int N = A.size();
while (true) {
string w = A[rand() % N];
int cnt = master.guess(w), len = 0;
if (cnt == 6) break;
for (int i = 0; i < N; ++i) {
if (countSame(A[i], w) == cnt) swap(A[i], A[len++]);
}
N = len;
}
}
};


Java

/**
* // This is the Master's API interface.
* // You should not implement it, or speculate about its implementation
* interface Master {
*     public int guess(String word) {}
* }
*/
class Solution {
public void findSecretWord(String[] wordlist, Master master) {
int length = wordlist.length;
int[][] sameCounts = new int[length][length];
for (int i = 0; i < length; i++)
sameCounts[i][i] = 6;
for (int i = 0; i < length; i++) {
String word1 = wordlist[i];
for (int j = i + 1; j < length; j++) {
String word2 = wordlist[j];
sameCounts[i][j] = sameCount(word1, word2);
sameCounts[j][i] = sameCounts[i][j];
}
}
boolean[] candidates = new boolean[length];
Arrays.fill(candidates, true);
int index = 0;
while (index >= 0 && index < length) {
index = findNext(sameCounts, candidates);
if (index < 0)
break;
int guessResult = master.guess(wordlist[index]);
if (guessResult == 6)
break;
for (int i = 0; i < length; i++) {
if (candidates[i] && sameCounts[index][i] != guessResult)
candidates[i] = false;
}
}
}

public int sameCount(String word1, String word2) {
int count = 0;
for (int i = 0; i < 6; i++) {
if (word1.charAt(i) == word2.charAt(i))
count++;
}
return count;
}

public int findNext(int[][] sameCounts, boolean[] candidates) {
int length = candidates.length;
int min = Integer.MAX_VALUE;
int minIndex = -1;
for (int i = 0; i < length; i++) {
if (candidates[i]) {
int[] counts = new int;
for (int j = 0; j < length; j++) {
if (j != i && candidates[j]) {
int count = sameCounts[i][j];
counts[count]++;
}
}
int max = 0;
for (int num : counts)
max = Math.max(max, num);
if (max < min) {
min = max;
minIndex = i;
}
}
}
return minIndex;
}
}