Anagram Check Program | Dataford Interview Questions

As part of a Wipro coding assessment, write a function that determines whether two strings contain exactly the same characters with the same frequencies. Two strings are anagrams if one can be rearranged to form the other.

Implement the function without changing the input strings. The comparison is case-sensitive, and each string contains only lowercase English letters. Return True when the strings are anagrams and False otherwise.

Formal Specification

Input: Two strings, s and t.
Output: A Boolean value.
Definition: The strings are anagrams when they have equal lengths and every character occurs the same number of times in both strings.

Constraints

0 <= len(s), len(t) <= 10^5
s and t contain only lowercase English letters
Return exactly one Boolean value
The input strings must not be modified

Function Signature

def is_anagram(s, t):

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

Input: Two strings, s and t.
Output: A Boolean value.
Definition: The strings are anagrams when they have equal lengths and every character occurs the same number of times in both strings.

Constraints

0 <= len(s), len(t) <= 10^5
s and t contain only lowercase English letters
Return exactly one Boolean value
The input strings must not be modified

Function Signature

def is_anagram(s, t):

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