Two hashmap  solution
\nfunc uncommonFromSentences(s1 string, s2 string) []string {\n    str1 := strings.Split(s1, " ")\n    str2 := strings.Split(s2, " ")\n    \n    wordSet1, wordS
```\nfunc uncommonFromSentences(s1 string, s2 string) []string {\n    str1 := strings.Split(s1, " ")\n    str2 := strings.Split(s2, " ")\n    \n    wordSet1, wordSet2 := make(map[string]int), make(map[string]int)\n    \n    for _, word := range str1 {\n        wordSet1[word]++\n    }\n    \n    for _, word := range str2 {\n        wordSet2[word]++\n    }\n    \n    var res []string\n    \n    for word, fre := range wordSet1 {\n        if _, ok := wordSet2[word]; !ok && fre == 1 {\n            res = append(res, word)\n        }\n    }\n    \n    for word, fre := range wordSet2 {\n        if _, ok := wordSet1[word]; !ok && fre == 1 {\n            res = append(res, word)\n        }\n    }\n    \n    return res\n}\n```
['Go']