Common Words
Let's continue examining words. You are given two strings with words separated by commas. Try to find what is common between these strings. The words in the same string don't repeat.
Your function should find all of the words that appear in both strings. The result must be represented as a string of words separated by commas in alphabetic order.
Input: Two arguments as strings (string).
Output: The common words as a string (string).
Examples:
assert.strictEqual(commonWords("hello,world", "hello,earth"), "hello");
assert.strictEqual(commonWords("one,two,three", "four,five,six"), "");
assert.strictEqual(
commonWords("one,two,three", "four,five,one,two,six,three"),
"one,three,two"
);
How it is used: Here you can learn how to work with strings and sets. This knowledge can be useful for linguistic analysis.
Preconditions:
- Each string contains no more than 10 words;
- All words are separated by commas;
- All words consist of lowercase latin letters.
