func IsAnagram(str1, str2 string) bool {
	if len(str1) != len(str2) {
		return false
	}

	str1 = strings.ToLower(str1)
	str2 = strings.ToLower(str2)

	set1 := datastructure.NewSet()
	set2 := datastructure.NewSet()

	for _, char := range str1 {
		set1.List[int(char)] = struct{}{}
	}

	for _, char := range str2 {
		set2.List[int(char)] = struct{}{}
	}

	return set1.Intersects(set2)
}
// IsAnagram checks if two strings are anagrams
IsAnagram checks if two strings are anagrams
// IsAnagram checks if two strings are anagrams
func IsAnagram(str1, str2 string) bool {
	if len(str1) != len(str2) {
		return false
	}
	str1 = strings.ToLower(str1)
	str2 = strings.ToLower(str2)
	set1 := datastructure.NewSet()
	set2 := datastructure.NewSet()
	for _, char := range str1 {
		set1.List[int(char)] = struct{}{}
	}
	for _, char := range str2 {
		set2.List[int(char)] = struct{}{}
	}
	return set1.Intersects(set2)
}
func IsAnagram ( str1 , str2 string ) bool { if len ( str1 ) != len ( str2 ) { return false } str1 = strings . ToLower ( str1 ) str2 = strings . ToLower ( str2 ) set1 := datastructure . NewSet ( ) set2 := datastructure . NewSet ( ) for _ , char := range str1 { set1 . List [ int ( char ) ] = struct { } { } } for _ , char := range str2 { set2 . List [ int ( char ) ] = struct { } { } } return set1 . Intersects ( set2 ) }
IsAnagram checks if two strings are anagrams
IsAnagram checks if two strings are anagrams