| about | help | code help+videos | done | prefs |
Given two input Strings a and b, determine if a is an anagram of b (meaning the letters in a are all used in b, the same number of times). Preconditions: a and b will both hold only lowercase letters, though their lengths may differ. apcsaIsAnagram("cars", "scar") → true apcsaIsAnagram("cards", "scar") → false apcsaIsAnagram("fish", "wish") → false ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 310
Copyright Nick Parlante 2017 - privacy