[Arrays & Hashing][Valid Anagram] - Implement solution for Leetcode 242 #7

Author: javydevx

.github/workflows/ci.yml

@@ -28,4 +28,5 @@ jobs:
       - name: Upload coverage to Codecov
         uses: codecov/codecov-action@v5
         with:
-          token: ${{ secrets.CODECOV_TOKEN }}
+          token: ${{ secrets.CODECOV_TOKEN }}
+          files: coverage.txt

1_arrays_and_hashing/2_valid_anagram/solution.go

@@ -0,0 +1,69 @@
+package validanagram
+
+import (
+	"sort"
+	"strings"
+)
+
+// Time complexity: O(n log n)
+// Space complexity : O(n)
+func IsAnagramSort(s, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+
+	sArr := strings.Split(s, "")
+	tArr := strings.Split(t, "")
+
+	sort.Strings(sArr)
+	sort.Strings(tArr)
+
+	return strings.Join(sArr, "") == strings.Join(tArr, "")
+}
+
+// Time complexity: O(n)
+// Space complexity: O(n)
+func IsAnagramMap(s, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+
+	counts := make(map[rune]int)
+	for _, r := range s {
+		counts[r]++
+	}
+	for _, r := range t {
+		counts[r]--
+		if counts[r] < 0 {
+			return false
+		}
+	}
+	return true
+}
+
+// Time complexity: O(n)
+// Space complexity: O(1)
+func IsAnagramArray(s, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+
+	var counts [26]int
+
+	for i := 0; i < len(s); i++ {
+		// we ensure the character is between 'a' and 'z'
+		if s[i] < 'a' || s[i] > 'z' || t[i] < 'a' || t[i] > 'z' {
+			return false
+		}
+
+		counts[s[i]-'a']++
+		counts[t[i]-'a']--
+	}
+
+	for _, v := range counts {
+		if v != 0 {
+			return false
+		}
+	}
+	return true
+}

1_arrays_and_hashing/2_valid_anagram/solution_test.go

@@ -0,0 +1,43 @@
+package validanagram
+
+import "testing"
+
+func TestIsAnagram(t *testing.T) {
+	cases := []struct {
+		name     string
+		fn       func(string, string) bool
+		s, t     string
+		expected bool
+	}{
+		// IsAnagramSort
+		{"Sort - Anagram", IsAnagramSort, "listen", "silent", true},
+		{"Sort - Not Anagram", IsAnagramSort, "hello", "world", false},
+		{"Sort - Empty Strings", IsAnagramSort, "", "", true},
+		{"Sort - Different Lengths", IsAnagramSort, "a", "ab", false},
+		{"Sort - Unicode Anagrams", IsAnagramSort, "école", "éocle", true},
+
+		// IsAnagramMap
+		{"Map - Anagram", IsAnagramMap, "listen", "silent", true},
+		{"Map - Not Anagram", IsAnagramMap, "hello", "world", false},
+		{"Map - Empty Strings", IsAnagramMap, "", "", true},
+		{"Map - Different Lengths", IsAnagramMap, "a", "ab", false},
+		{"Map - Unicode Anagrams", IsAnagramMap, "école", "éocle", true},
+
+		// IsAnagramArray
+		{"Array - Anagram", IsAnagramArray, "listen", "silent", true},
+		{"Array - Not Anagram", IsAnagramArray, "hello", "world", false},
+		{"Array - Empty Strings", IsAnagramArray, "", "", true},
+		{"Array - Different Lengths", IsAnagramArray, "a", "ab", false},
+		{"Array - Unicode Anagrams", IsAnagramArray, "école", "éocle", false},
+	}
+
+	for _, c := range cases {
+		t.Run(c.name, func(t *testing.T) {
+			got := c.fn(c.s, c.t)
+			if got != c.expected {
+				t.Errorf("%s failed: expected %v, got %v", c.name, c.expected, got)
+
+			}
+		})
+	}
+}

coverage.out

@@ -1,25 +1 @@
 mode: set
-github.com/javy99/problem-solving-golang/main/hello.go:3.21,5.2 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:7.52,8.33 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:8.33,9.38 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:9.38,10.26 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:10.26,12.5 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:15.2,15.14 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:20.48,22.33 2 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:22.33,23.27 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:23.27,25.4 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:27.2,27.14 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:32.49,34.27 2 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:34.27,35.16 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:35.16,37.4 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:38.3,38.19 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:40.2,40.14 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:45.51,47.27 2 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:47.27,48.29 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:48.29,50.4 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:51.3,51.25 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:53.2,53.14 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:58.50,60.27 2 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:60.27,62.22 2 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:62.22,64.4 1 1
-github.com/javy99/problem-solving-golang/1_arrays_and_hashing/1_contains_duplicate/solution.go:66.2,66.14 1 1