242. Valid Anagram

Author: maxvoronov

README.md

@@ -1,6 +1,6 @@
 # LeetCode
 
-![Problems Solved](https://img.shields.io/badge/Problems%20Solved-30%20%2F%203018-1f425f?logo=leetcode)
+![Problems Solved](https://img.shields.io/badge/Problems%20Solved-31%20%2F%203022-1f425f?logo=leetcode)
 ![Language: Golang](https://img.shields.io/badge/language-Golang-00ADD8?logo=go)
 ![Language: Rust](https://img.shields.io/badge/language-Rust-00ADD8?logo=rust)
 ![Language: Bash](https://img.shields.io/badge/language-Bash-00ADD8?logo=gnubash&logoColor=f5f5f5)
@@ -30,6 +30,7 @@
 | 155 | [Min Stack](https://leetcode.com/problems/min-stack/)                                                                           | [Go](go/0155_min_stack)                                                         |     🟢     |                 Stack                  |
 | 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)                                                         | [Go](go/0217_contains_duplicate)                                                |     🟢     |           Array, Hash Table            |
 | 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)                                                         | [Go](go/0226_invert_binary_tree)                                                |     🟢     |      Tree, BFS, DFS, Binary Tree       |
+| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/)                                                                   | [Go](go/0242_valid_anagram)                                                     |     🟢     |           Hash Table, String           |
 | 268 | [Missing Number](https://leetcode.com/problems/missing-number/)                                                                 | [Go](go/0268_missing_number)                                                    |     🟢     |     Array, Math, Bit Manipulation      |
 | 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/)                                                                       | [Go](go/0283_move_zeroes)                                                       |     🟢     |             Array, Pointer             |
 | 344 | [Reverse String](https://leetcode.com/problems/reverse-string/)                                                                 | [Go](go/0344_reverse_string), [Rust](rust/_0344_reverse_string)                 |     🟢     |            String, Pointer             |

go/0242_valid_anagram/solution.go

@@ -0,0 +1,21 @@
+package valid_anagram
+
+func isAnagram(s string, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+
+	m := make(map[byte]int16, len(s))
+	for i := 0; i < len(s); i++ {
+		m[s[i]]++
+		m[t[i]]--
+	}
+
+	for _, val := range m {
+		if val != 0 {
+			return false
+		}
+	}
+
+	return true
+}

go/0242_valid_anagram/solution_test.go

@@ -0,0 +1,27 @@
+package valid_anagram
+
+import "testing"
+
+func Test_isAnagram(t *testing.T) {
+	tests := []struct {
+		inputS string
+		inputT string
+		want   bool
+	}{
+		{inputS: "anagram", inputT: "nagaram", want: true},
+		{inputS: "restful", inputT: "fluster", want: true},
+		{inputS: "rat", inputT: "car", want: false},
+		{inputS: "x", inputT: "x", want: true},
+		{inputS: "a", inputT: "ab", want: false},
+		{inputS: "aa", inputT: "bb", want: false},
+		{inputS: "aac", inputT: "bcb", want: false},
+		{inputS: "ab", inputT: "ba", want: true},
+	}
+
+	for i, tc := range tests {
+		got := isAnagram(tc.inputS, tc.inputT)
+		if tc.want != got {
+			t.Fatalf("Case #%d: expected: %v, got: %v", i+1, tc.want, got)
+		}
+	}
+}