Dropbox·Software Engineer·Technical Phone Screen
- You have a set of distinct lowercase words of equal length. An adversarial host picks one but can switch to any consistent word after each guess. Each turn you guess one new letter and the host reveals where it appears (or says it's absent if some valid word lacks it). What is the minimum number of letter guesses needed to guarantee identifying the hidden word, assuming optimal guessing strategy?
“This one messed with my head for a bit.”