String Anagram Check and Testing | Dataford Interview Questions

How would you check whether two strings are anagrams, and how would you design a testing framework for it?

Implement a case-sensitive function that treats every character, including spaces and punctuation, as significant. Describe a compact test strategy covering normal cases, boundary cases, and randomized validation.

Contract

is_anagram(s, t) accepts two strings and returns True if they contain identical character frequencies, otherwise False.

Constraints

0 <= len(s), len(t) <= 100000
Inputs contain valid Python strings
Comparison is case-sensitive
Spaces, punctuation, and Unicode characters are significant

Function Signature

def is_anagram(s, t):

Your question is String Anagram Check and Testing. 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