Anagram Check Algorithm | Dataford Interview Questions

KnowBe4 may compare labels from phishing simulations or security-awareness content after differences in capitalization and punctuation are removed. Implement an algorithm that determines whether two strings are anagrams under this normalization rule.

Two strings are normalized by applying Unicode casefold() and keeping only alphanumeric characters. Return True when both normalized strings contain exactly the same characters with the same frequencies. Return False otherwise.

Formal Specification

Implement is_anagram(first, second), where both inputs must be strings. The function returns a Boolean and raises TypeError if either argument is not a string. The comparison must not mutate either input. Refactor normalization into a clear helper or logically separate step, and explain how you would test both normal and invalid inputs.

Constraints

0 <= len(first), len(second) <= 10^6
Inputs may contain Unicode characters, whitespace, punctuation, and digits
Comparison uses Unicode casefolding
Non-alphanumeric characters are ignored
Both arguments must be strings

Function Signature

def is_anagram(first, second):

Your question is Anagram Check Algorithm. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Formal Specification

Constraints

0 <= len(first), len(second) <= 10^6
Inputs may contain Unicode characters, whitespace, punctuation, and digits
Comparison uses Unicode casefolding
Non-alphanumeric characters are ignored
Both arguments must be strings

Function Signature

def is_anagram(first, second):

Your question is Anagram Check Algorithm. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.