Algorithm · Bloomberg · Hard
You are given two collections of words: a dictionary containing N distinct strings, a set of Q query strings. For every query, your task is to select the dictionary entry that minimizes the Levenshtein distance to the query. The Levenshtein distance between two strings is the smallest number of single‑character edits required to transform one string into the other. An allowed edit is any of: inserting one character, deleting one character, or replacing one character with a…
Checking your access…