How should I practice Best Anagram Match?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google phone screen problems in FastPrep.

Is Best Anagram Match associated with Google?

FastPrep tags this as a Google phone screen coding practice problem when the problem catalog has that company and stage context.

Best Anagram Match

Google● EasyFULLTIMEPHONE SCREEN

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.

An exact anagram has the same length and the same character frequencies. Return the empty string when no candidate qualifies.

Function

findBestAnagram(target: String, candidates: String[]) → String

Examples

Example 1

target = "listen"candidates = ["silent","enlist","google"]return = "enlist"

Both silent and enlist are anagrams; enlist is lexicographically smaller.

Example 2

target = "abc"candidates = ["ab","abd"]return = ""

No candidate has the same multiset.

Constraints

1 <= target.length <= 10^5.
0 <= candidates.length <= 10^5.
All strings contain lowercase English letters.