Google | Onsite | Jotto solver
2256

This is a problem I still don't know the answer.

Jotto is kind of a Mastermind but with words (Wiki).
Basically, there are two players. One of them choose a word of 5 letters from the english dictionary, and the other one has to find it as quick as possible.

You have to write a function that have the dictionary as input, and returns the correct word. Every time you want to test a word, you have to call a function int guess(word) that only returns the number of correct letters. For example, if you test 'sheep' and the correct word is 'sweet', the function will return 3 but you have no indication about their indexes.

The rules are pretty simple and here are the constraints :

  • The word must exist in the english dictionary
  • The tested word must exist in the english dictionary
  • You can admit all the letters are lowercases

I found a very similar post that someone else posted a year ago, but no one actually found a solution for it so far so I hope someone will find it now !

Comments (3)