Check Anagrams | Dataford Interview Questions

Venmo payment-note tooling may need to compare text values independent of character order. Given two strings, determine whether they are anagrams of each other.

Two strings are anagrams when they have the same length and contain exactly the same lowercase English letters with the same frequencies. Character order does not matter, and repeated characters must be counted separately.

Formal Specification

Implement are_anagrams(s, t).

Input: Two strings s and t containing only lowercase English letters.
Output: Return True if s and t are anagrams, otherwise return False.
Do not modify either input string.

Constraints

0 <= len(s), len(t) <= 100,000
s and t contain only lowercase English letters
Return a Boolean value

Function Signature

def are_anagrams(s, t):

Your question is Check Anagrams. 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