refactor Valid Anagram

Author: rihib

go/valid_anagram.go

@@ -2,18 +2,31 @@
 package main
 
 func isAnagram(s string, t string) bool {
-	if len(s) != len(t) {
-		return false
+	var frequency [26]int
+	for _, r := range s {
+		frequency[r-'a']++
 	}
-
-	var freq [26]int
-	for i := 0; i < len(s); i++ {
-		freq[s[i]-'a']++
-		freq[t[i]-'a']--
+	for _, r := range t {
+		frequency[r-'a']--
+	}
+	for _, n := range frequency {
+		if n != 0 {
+			return false
+		}
 	}
+	return true
+}
 
-	for _, v := range freq {
-		if v != 0 {
+func isAnagram_unicode(s string, t string) bool {
+	frequency := make(map[rune]int)
+	for _, r := range s {
+		frequency[r]++
+	}
+	for _, r := range t {
+		frequency[r]--
+	}
+	for _, n := range frequency {
+		if n != 0 {
 			return false
 		}
 	}