Strings · Coding problem
Valid Anagram
A free coding problem from the String Manipulation Basics skill. Read it here, then solve it in the app in Java or Python.
- Easy
- Coding problem
- Free
- Java and Python
The problem
Two strings are anagrams when one is the other with its letters shuffled: the same letters, each used the same number of times. Return whether t is an anagram of s.
Example
Input: s = "dusty", t = "study"
Output: true
Constraints
1 <= s.length, t.length <= 5 * 10^4sandtconsist of lowercase English letters only, no spaces
How it's graded
- Run checks your code against the examples. Submit also runs a hidden suite in four groups - basic cases, edge cases, random inputs and performance tests at the size limit - and shows which groups pass, never the hidden inputs.
- Stuck? Hints come in four steps, from a nudge to a code skeleton, each costing part of the points.
- Once you pass, you see the approaches from brute force to optimal, and where your solution lands among them.
More problems in String Manipulation Basics
Solve it Valid Anagram free
No card needed. Lessons, practice questions and easy problems are free forever.
Free plan, no card · 7-day Pro trial · Cancel anytime