Code Room
CodingEasycod-g1378
Subject StringsLevel Entry–Mid~12 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a list of lowercase words and a lowercase target word, return the first word in the list that is an anagram of the target but not identical to it. Return an empty string if there is none. For example, with words ['stale', 'hello', 'least'] and target 'steal', the answer is 'stale'.

Implement
anagram_partner(words: list[str], target: str) → str
Examples
in[["stale","hello","least"],"steal"]out"stale"
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.