Correct Words Using Dictionary Rules | Dataford Interview Questions

Given a word dictionary {kite, yellow} and a list of words {KITe, kiTE, yollow, yeellow}, output the corrected words based on specific rules. Matching is case-insensitive, and every dictionary word is returned in lowercase. Correct a nonmatching word only when exactly one dictionary word is either one character substitution away or can produce the input by inserting one duplicate adjacent character; otherwise, leave the input lowercase and unchanged. Implement def correct_words(dictionary, words):, returning a list with one output per input word.

Constraints

1 <= dictionary.length <= 500
0 <= words.length <= 500
1 <= dictionary[i].length, words[j].length <= 50
Dictionary and input words contain only English alphabetic characters
Dictionary entries are compared without regard to case
Return exactly one output string for each input word

Function Signature

def correct_words(dictionary, words):

Your question is Correct Words Using Dictionary Rules. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= dictionary.length <= 500
0 <= words.length <= 500
1 <= dictionary[i].length, words[j].length <= 50
Dictionary and input words contain only English alphabetic characters
Dictionary entries are compared without regard to case
Return exactly one output string for each input word

Function Signature

def correct_words(dictionary, words):

Your question is Correct Words Using Dictionary Rules. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.