Learn and practice the Hash Maps and Knowing What to Track patterns to solve coding interview problems.

Educative-99 in Python: Accelerate Your Coding Interview Prep

Hash maps are powerful data structures that enable programmers to design more efficient solutions for certain problems. After practicing solving problems using hash maps, we will move to the more general problem-solving skill of figuring out the key characteristics of a problem, using various techniques to track them, in order to design remarkably efficient solutions for seemingly complex problems.

Hashing and Tracking

# 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:**

- $1 \leq$ `str1.length`, `str2.length` $\leq 10^3$

- `str1` and `str2` consist of only lowercase English letters.


# Examples

Valid Anagram

Statement