Create README - LeetHub

Author: hajin-kim

0843-guess-the-word/README.md

@@ -0,0 +1,54 @@
+<h2><a href="https://leetcode.com/problems/guess-the-word/?envType=study-plan-v2&envId=google-spring-23-high-frequency">843. Guess the Worda>h2><h3>Hardh3><hr><p>You are given an array of unique strings <code>wordscode> where <code>words[i]code> is six letters long. One word of <code>wordscode> was chosen as a secret word.p>
+
+<p>You are also given the helper object <code>Mastercode>. You may call <code>Master.guess(word)code> where <code>wordcode> is a six-letter-long string, and it must be from <code>wordscode>. <code>Master.guess(word)code> returns:p>
+
+<ul>
+	-1 if word is not from words, or
+	an integer representing the number of exact matches (value and position) of your guess to the secret word.
+ul>
+
+<p>There is a parameter <code>allowedGuessescode> for each test case where <code>allowedGuessescode> is the maximum number of times you can call <code>Master.guess(word)code>.p>
+
+<p>For each test case, you should call <code>Master.guesscode> with the secret word without exceeding the maximum number of allowed guesses. You will get:p>
+
+<ul>
+	"Either you took too many guesses, or you did not find the secret word." if you called Master.guess more than allowedGuesses times or if you did not call Master.guess with the secret word, or
+	"You guessed the secret word correctly." if you called Master.guess with the secret word with the number of calls to Master.guess less than or equal to allowedGuesses.
+ul>
+
+<p>The test cases are generated such that you can guess the secret word with a reasonable strategy (other than using the bruteforce method).p>
+
+<p>&nbsp;p>
+<p><strong class="example">Example 1:strong>p>
+
+<pre>
+<strong>Input:strong> secret = &quot;acckzz&quot;, words = [&quot;acckzz&quot;,&quot;ccbazz&quot;,&quot;eiowzz&quot;,&quot;abcczz&quot;], allowedGuesses = 10
+<strong>Output:strong> You guessed the secret word correctly.
+<strong>Explanation:strong>
+master.guess(&quot;aaaaaa&quot;) returns -1, because &quot;aaaaaa&quot; is not in wordlist.
+master.guess(&quot;acckzz&quot;) returns 6, because &quot;acckzz&quot; is secret and has all 6 matches.
+master.guess(&quot;ccbazz&quot;) returns 3, because &quot;ccbazz&quot; has 3 matches.
+master.guess(&quot;eiowzz&quot;) returns 2, because &quot;eiowzz&quot; has 2 matches.
+master.guess(&quot;abcczz&quot;) returns 4, because &quot;abcczz&quot; has 4 matches.
+We made 5 calls to master.guess, and one of them was the secret, so we pass the test case.
+pre>
+
+<p><strong class="example">Example 2:strong>p>
+
+<pre>
+<strong>Input:strong> secret = &quot;hamada&quot;, words = [&quot;hamada&quot;,&quot;khaled&quot;], allowedGuesses = 10
+<strong>Output:strong> You guessed the secret word correctly.
+<strong>Explanation:strong> Since there are two words, you can guess both.
+pre>
+
+<p>&nbsp;p>
+<p><strong>Constraints:strong>p>
+
+<ul>
+	1 <= words.length <= 100
+	words[i].length == 6
+	words[i] consist of lowercase English letters.
+	All the strings of wordlist are unique.
+	secret exists in words.
+	10 <= allowedGuesses <= 30
+ul>