Anagram Coding Challenge | Dataford Interview Questions

Kforce Technology Staffing can compare normalized text values in a candidate profile matching workflow. Implement a function that determines whether two strings are anagrams.

Two strings are anagrams when they contain exactly the same lowercase English letters with the same frequencies, regardless of order. Return True if they are anagrams and False otherwise.

Formal Specification

Input: Two strings, s and t, containing only lowercase English letters.
Output: A boolean indicating whether s and t are anagrams.
The strings must have equal lengths to be anagrams.

Constraints

1 <= len(s), len(t) <= 5 * 10^4
s and t contain only lowercase English letters
Character order does not affect the result

Function Signature

def is_anagram(s, t):

Your question is Anagram Coding Challenge. 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