How should I practice Minimum Edit-Distance String for Each Query?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Target online assessment problems in FastPrep.

Is Minimum Edit-Distance String for Each Query associated with Target?

FastPrep tags this as a Target online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · String

Minimum Edit-Distance String for Each Query

Learn this problem

● Medium

TargetFULLTIMEOA

Problem statement

You are given an array of distinct candidate strings strings and an array of query strings queries. The edit distance between two strings is the minimum number of single-character insertions, deletions, and replacements needed to transform one string into the other. Each operation costs one.

For each query, return the candidate string with minimum edit distance to that query. If several candidates have the same minimum distance, return the lexicographically smallest candidate.

Comparisons are case-sensitive and use the characters exactly as provided, without additional normalization.

Implement findClosestStrings(strings, queries).

Function

findClosestStrings(strings: String[], queries: String[]) → String[]

Examples

Example 1

strings = ["cat","bat","rat"]queries = ["hat","cats"]return = ["bat","cat"]

For "hat", all three candidates are one replacement away, so the lexicographically smallest, "bat", is returned. For "cats", deleting the final 's' gives "cat" in one edit.

Example 2

strings = ["Apple","apple"]queries = ["apple"]return = ["apple"]

The comparison is case-sensitive, so "apple" has distance zero and is selected.

Constraints

1 <= strings.length <= 100.
1 <= queries.length <= 50.
Every string has length between 1 and 50, inclusive.
Candidate strings are distinct.
Strings contain printable ASCII characters.