How should I practice Check Anagrams Without Sorting?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon onsite interview problems in FastPrep.

Is Check Anagrams Without Sorting associated with Amazon?

FastPrep tags this as a Amazon onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · String

Check Anagrams Without Sorting

Learn this problem

● Easy

AmazonNEW GRADONSITE INTERVIEW

See Amazon hiring insights

Problem statement

Given two lowercase English strings first and second, return whether they are anagrams.

Two strings are anagrams when every letter has the same frequency in both strings. Solve the task with character-frequency counting; do not sort either string.

Function

areAnagrams(first: String, second: String) → boolean

Examples

Example 1

first = "listen"second = "silent"return = true

Both words contain the same six letters with equal frequencies.

Example 2

first = "aab"second = "abb"return = false

The multiplicities of a and b differ.

Example 3

first = "amazon"second = "amazon"return = true

A string is an anagram of itself.

Constraints

1 <= first.length, second.length <= 100000.
Both strings contain only lowercase English letters.
Do not sort the strings.