It's been over a week since the last programming challenge and the previous one was a bit more difficult, so let's do something easier and more accessible to newer programmers in particular. Write a function that takes two strings as input and returns
true if they're anagrams of each other, or
false if they're not.
Extra credit tasks:
- Don't consider the strings anagrams if they're the same barring punctuation.
- Write an efficient implementation (in terms of time and/or space complexity).
- Minimize your use of built-in functions and methods to bare essentials.
- Write the worst--but still working--implementation that you can conceive of.