Скачать или смотреть Guess the Word Leetcode

Simple Java solution explained. Leetcode 843

UPDATE - I have added a new video with updated solution only changing a few lines. This is the update of this code:    • Guess The Word Leetcode  UPDATED SOLUTION ...  

If this helped you 😭 Please subscribe!
   / @optimized_code  

❤️ Thank you if you already have.


Palindrome Linked List:    • 234. Palindrome Linked List - Easiest Solu...  

Bus Routes:    • Bus Routes - Leetcode 815 - Java - Leetcod...  

Min Stack:    • Min Stack - Leetcode 155  

Fizz Buzz:    • Fizz Buzz - Java - Fastest Solution  

Lowest Common Ancestor of a Binary Tree:    • 1650. Lowest Common Ancestor of a Binary T...  

Find All Possible Recipes From Given Supplies:    • Find All Possible Recipes from Given Supplies  

Find Leaves of Binary Tree:    • Find Leaves of Binary Tree | Leetcode 366 ...  


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.