Anagram String Comparison Function | Dataford Interview Questions

Your question is Anagram String Comparison Function. Start with the requirements on the right.

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

Problem

Wolfspeed's wafer-test quality dashboard receives pairs of lowercase test labels that may use the same characters in a different order. Write a function that returns True if the two strings are anagrams and False otherwise.

Two strings are anagrams when they contain exactly the same characters with the same frequencies. Character order does not matter, but every occurrence matters.

Formal Specification

Implement are_anagrams(s, t):

Input: Two strings s and t containing only lowercase English letters from a through z.
Output: A Boolean. Return True when s and t are anagrams; otherwise, return False.
The comparison is case-sensitive, although the constraints exclude uppercase characters.

Constraints

0 <= len(s), len(t) <= 10^5
s and t contain only lowercase English letters
Anagrams must preserve character frequencies

Function Signature

def are_anagrams(s, t):