Last active
March 17, 2016 14:55
-
-
Save vinnymac/87f5660ffe4f2e4c2e88 to your computer and use it in GitHub Desktop.
Test whether or not two strings are permutations of each other.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| arePermutations = (str1, str2) -> | |
| return false unless str1.length is str2.length | |
| occurrences = {} | |
| for i in [0...str1.length] | |
| char = str1.charAt(i) | |
| occurrences[char] = (occurrences[char] or 0) + 1 | |
| for i in [0...str2.length] | |
| char = str2.charAt(i) | |
| return false unless occurrences[char] | |
| occurrences[char] -= 1 | |
| return false if occurrences[char] < 0 | |
| return true |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment