You are given a list of candidate words words, where each word has length $6$ and all words are distinct. One of these words is the hidden word secret.

You can interact with an external API master.guess(word), which takes a string word and returns an integer equal to the number of positions where word and secret have the same character. If word is not present in words, the API returns $-1$.

Implement findSecretWord(words, master) to identify secret by calling master.guess at most allowedGuesses times.

Note: Each call to master.guess must use a word from words, and secret is guaranteed to be in words.

Constraints:

• $1 \leq$ words.length $\leq 100$

• words[i].length $= 6$

• words[i] consists of lowercase English letters

• All strings in words are unique

• secret exists in words

• $10 \leq$ allowedGuesses $\leq 30$

Input: words = ["acckzz","ccbazz","eiowzz","abcczz"]-List[str], secret = "acckzz"-str, allowedGuesses = 10-int
Output: "acckzz"-str
Explanation: The secret is hidden from the algorithm, and the function identifies "acckzz" within the allowed guesses. One valid interaction: master.guess("eiowzz") returns 2 (matching "acckzz" at positions 5 and 6, z,z), so candidates are filtered to those that would also produce 2 matches with "eiowzz"; master.guess("abcczz") returns 4 and the list is filtered again; finally master.guess("acckzz") returns 6, meaning the guess equals the secret.

Input: words = ["planet","people","placer","plaque","plains","planer"]-List[str], secret = "planer"-str, allowedGuesses = 10-int
Output: "planer"-str
Explanation: The secret is hidden from the algorithm, and the function identifies "planer" within the allowed guesses. One possible sequence: master.guess("planet") returns 5, since "planet" differs from "planer" only at position 5 (t vs r); keeping only words that would also match "planet" in exactly 5 positions heavily narrows the list, and master.guess("planer") then returns 6, finding the secret.

Input: words = ["aaaaaa","aaaabb","aaabbb","aabbbb","abbbbb","bbbbbb"]-List[str], secret = "aaabbb"-str, allowedGuesses = 10-int
Output: "aaabbb"-str
Explanation: The secret is hidden from the algorithm, and the function identifies "aaabbb" within the allowed guesses. A possible interaction: master.guess("aaaaaa") returns 3 (matching the first 3 positions); filtering to candidates that yield exactly 3 matches with "aaaaaa" eliminates words like "bbbbbb" (0 matches) and "aaaabb" (4 matches), and master.guess("aaabbb") then returns 6, finding the secret.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.