Smart Matching

Problem statement

Given a list of different words and an array of string queries, return a boolean array answer where answer[i] is true if you can change exactly one character in the $i^{th}$ query string to match any word in the list; return false otherwise.

Example

Sample input