Given a list of unique six-letter words and an API that, for any guessed word from the list, returns the number of characters that match the secret in both value and position, identify the secret within a limited number of guesses. The core challenge is designing a guessing strategy (e.g., minimax or information-gain elimination) that efficiently prunes candidates based on match counts to guarantee finding the secret within allowedGuesses.
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
Maximize probability of guessing a secret word in 5 tries. Given an interface with isValid(char c) and getWord() methods, implement a function to guess the secret word consisting of uppercase characters. Initially, getWord() returns a string with special characters that get replaced as correct guesses are made.
Guess the password: Given a set of tuples, determine the unique possible password. The password is max 7 characters long, characters are not repeated, and their order must be maintained based on the input tuples.
Nenhum anexo público associado a esta pergunta.
Depois de treinar essa pergunta, vale abrir outras do mesmo tipo e da mesma senioridade para comparar padrões de resposta.
Isso ajuda a sair da memorização de uma resposta só e entrar em repertório real de entrevista.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.
Amazon