X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Anagram
Easy Accuracy: 50.99% Submissions: 63396 Points: 2

Given two stringsaandbconsisting of lowercase characters. The task is to check whether two given strings are an anagram of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different. For example, act and tac are an anagram of each other.

Example 1:

Input:a = geeksforgeeks, b = forgeeksgeeks
Output: YES
Explanation: Both the string have samecharacters with
same frequency. So, both are anagrams.

Example 2:

Input:a = allergy, b = allergic
Output: NO
Explanation:Characters in both the strings are
not same, so they are not anagrams.

You don't need to read input or print anything.Yourtask is to complete the functionisAnagram() which takes the string a and string b as input parameterand checkif the two strings are an anagram of each other. The functionreturns trueif the strings are anagram else itreturns false.

Expected Time Complexity:O(|a|+|b|).
Expected Auxiliary Space:O(Number of distinct characters).

Note: |s| represents the length of string s.

Constraints:
1 ≤ |a|,|b| ≤ 105

We are replacing the old Disqus forum with the new Discussions section given below.