GoLang Solution For LeetCode Problem: Uncommon Words from Two Sentences
Solving Uncommon Words from Two Sentences in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Return a list of all uncommon words.
You may return the list in any order.
Input: A = "this apple is sweet", B = "this apple is sour" Output: ["sweet","sour"]
Input: A = "apple apple", B = "banana" Output: ["banana"]
0 <= A.length <= 200
0 <= B.length <= 200
See the full details of the problem Uncommon Words from Two Sentences at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go