Best Anagram Match
Problem statement
Given a lowercase target string and a list of lowercase candidate words, return the lexicographically smallest candidate that is an exact anagram of the target.
The problem statement continues
ProExamples
Example 1
target = "listen"candidates = ["silent","enlist","google"]return = "enlist"Both silent and enlist are anagrams; enlist is lexicographically smaller.
FastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week