Solution: Valid Anagram

Let's solve the Valid Anagram problem using the Knowing What to Track pattern.

Statement

Given two strings, str1 and str2, check whether str2 is an anagram of str1.

An anagram is a word or phrase created by rearranging the letters of another word or phrase while utilizing each of the original letters exactly once.

Constraints:

  • 11 \leq str1.length ...

Access this course and 1400+ top-rated courses and projects.