Quick Overview

For each query string, select the indexed candidate with the smallest exact edit distance under a deterministic tie-break. The problem assesses dynamic-programming fundamentals, empty-prefix cases, duplicate candidates, memory optimization, complexity analysis, and the limits of greedy comparison.

Find the Closest Candidate String by Edit Distance

Company: Target

Role: Backend Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Online Assessment

Overview: For each query string, select the indexed candidate with the smallest exact edit distance under a deterministic tie-break. The problem assesses dynamic-programming fundamentals, empty-prefix cases, duplicate candidates, memory optimization, complexity analysis, and the limits of greedy comparison.

Loading…