Search⌘ K
AI Features

Solution: Valid Anagram

Explore how to check if two strings are anagrams by understanding and applying the frequency counting pattern. This lesson helps you implement an efficient solution with linear time and constant space complexity, improving your problem-solving skills for coding interviews.

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, str2.length 103\leq 10^3

  • str1 and str2 ...