I have this idea (using C language) for checking for two string if they are anagrams-
if the length of the strings is the same (its only a-z and A-Z).
sum of ASCII value of all chars in a string is the same for both strings.
multiplication of ASCII value of all chars in a string is the same for both strings.
I believe that if all three are correct it must be an anagram but I cannot prove it.. since I have no math background.. can any one prove it or contradict it?
(other solutions for this problem are not necessery)