Stack Bash - Master data structures and algorithms

Check if two strings are an anagram

Write a method that accepts two strings and returns true if they're anagrams.
Remember, an anagram is a word that is a rearrangement of all the letters of another word.
For example, the following inputs are anagrams, and should return true:
  1. aabcd and bacda
  2. restful and fluster


6 Essential Strings Coding Interview Problems

Master Strings by trying the coding challenges below.
  1. 1.Reverse StringEasy
  2. 2.AnagramEasy
  3. 3.Reverse wordsMedium
  4. 4.String matchMedium
  5. 5.CompressionMedium
  6. 6.One edit awayHard

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.