Given 2 strings ,determine if they are anagrams of each other.
example :
input:
listen silent
output:
True
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 160 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Given 2 strings ,determine if they are anagrams of each other.
example :
input:
listen silent
output:
True
Name |
---|
Sort the strings and check if they are equal.
I suggest you use hashing. A good hashing function in this case is adding the characters, since anagrams will result in the same sum!
No way this goes wrong!
I think this code helps with your problem, although it's a bit long, it is easily understandable and a brute-force solution.
Hope you find it easy...