Find an Anagram of a String in Another String

Published by persolut in
regexstringsvalidation

Create a function that takes two strings and determines if an anagram of the first string is in the second string. Anagrams of "bag" are "bag", "bga", "abg", "agb", "gab", "gba". Since none of those anagrams are in "grab", the answer is false. A "g", "a", and "b" are in the string "grab", but they're split up by the "r".

Examples

anaStrStr("car", "race") ➞ true

anaStrStr("nod", "done") ➞ true

anaStrStr("bag", "grab") ➞ false

Notes

  • Inputs will be valid strings in all lowercase letters.
  • There exists a linear time algorithm for this.
Watch a quick demo on how Edabit works.