Check if 2 strings are anagrams #go

anagrams.go

/*
To find if 2 strings are anagrams we simply put each letter of first into a frequency table. Then for each other letter of b we subtract that count. 
At the end we have a frequency table that all the values are 0.
*/

func Anagrams(a string, b string) bool {
	count := int32(0)
	frequencies := make(map[rune]int32)
	for _, val := range a {
		frequencies[val] = frequencies[val] + 1
	}
	for _, val := range b {
		frequencies[val] = frequencies[val] - 1
	}
	for _, val := range frequencies {
		if val < 0 {
			count += -(val)
		} else {
			count += val
		}
	}
	return count == 0
}