Algorithm · Dropbox · Easy
Problem Statement You are given a list of valid words (the dictionary), a secret word, and a guessed word. Your task is to produce feedback for each character of the guessed word by comparing it to the secret word. The feedback for each position is determined as follows: If the guessed letter matches the secret letter at the same position, return "match". If the guessed letter does not match at that position but appears somewhere else in the secret word, return "exists".…
Checking your access…