Valid Anagram
Explore how to verify if one string is an anagram of another by tracking character frequencies. Understand constraints and implement an efficient solution to this classic problem, building skills with frequency tracking patterns useful in coding interviews.
We'll cover the following...
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:
-
str1.length,str2.length -
str1andstr2consist of only lowercase English letters.
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:
Valid Anagram
What’s the correct output for the following inputs?
str1 = “heart”
str2 = “earth”
TRUE
FALSE
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in the following coding playground.
import java.util.*;public class Main{public static boolean isAnagram(String str1, String str2) {// Replace this placeholder return statement with your codereturn false;}}