Leetcode Daily Question: 22 Apr 2026 · Coding Interview Academy

Leetcode Daily Question: 22 Apr 2026

Level: Medium

Find all query words that differ from at least one dictionary word in at most two character positions, and return them in their original order.

Solution:

A transformation is valid if the Hamming distance between a query word and a dictionary word is ≤ 2.
For each query, iterate through all dictionary words and compute the character-wise mismatch count.
If any dictionary word has ≤ 2 mismatches, include the query in the result and stop further checks for that query (aka. early break).

3 comments

skool.com/coding-interview-academy-2634

Land your dream tech job, master DSA and problem solving, crack coding interviews, and learn the strategies top candidates use to get offers.

Bring people together around your passion and get paid.