Uncommon Characters Problem Statement

Given two strings str1 and str2 containing only lowercase alphabets, find the characters that are unique to each string, i.e., characters that occur in only one of the strings and not in both.

Return these uncommon characters in lexicographically sorted order.

Example:

Input:

str1 = "characters", str2 = "alphabets"

Output:

"bchlr"

Explanation:

The uncommon characters are 'b', 'c', 'h', 'l', and 'r'.

Constraints:

1

Question

Uncommon Characters Problem Statement

Given two strings str1 and str2 containing only lowercase alphabets, find the characters that are unique to each string, i.e., characters that occur in only one of the strings and not in both.

Return these uncommon characters in lexicographically sorted order.

Example:

Input:

str1 = "characters", str2 = "alphabets"

Output:

"bchlr"

Explanation:

The uncommon characters are 'b', 'c', 'h', 'l', and 'r'.

Constraints:

1 <= T <= 10
1 <= |str1|, |str2| <= 50000
The input strings contain only lowercase alphabets.

Note:

You do not need to handle input/output operations; just implement the function to compute the answer.

Accepted Answer

Find uncommon characters in two strings and return them in lexicographically sorted order.

Iterate through each character in both strings and keep track of their frequency using a hashmap.
Iterate through the hashmap and add characters with frequency 1 to the result array.
Sort the result array in lexicographical order and return it.