Re^4: compare two strings and return only he unique values.

[Kenosis]

Your code quite effectively forms a union of the two strings' characters. However, the OP's request was to 1) compare two strings, and 2) return only the unique values. Where does your code compare the two strings? Forming a union of their characters does not compare the two strings. In fact, if we strictly regard their union as a non-multiset of characters, "a" is unique, since (set notation): {a} = {a,a} = {a,a,a}. Thus, "a" should still appear in their union--even with two occurrences within one string.

As has been point out, the OP's specs are equivocal, yet I tend to favor "unique" as meaning a character (replicated or not) that only belongs to one or the other string (i.e., "unique to")--and is not in both.

[blue_cowdawg]

I am trying to display unique values from two strings "ABCDE", "BCDEO" to return "AO"

was the OP's request. As a matter of fact my code does exactly what they were asking for. Splitting the two strings into single characters and counting the character's occurrence within the string is how I'd approach it.

[Kenosis]

Yes--I do understand, and your code works perfectly well for that initial case. Then the OP shows the following case:

my $string1="ABCDE";
my $string2="BBBBB";

Had the OP used $string2="FFFFF";, your code would not show "F", even though--after a string comparison--"F" is unique to $string2.

I see many good minds working on this issue with different POVs. Again, I think it evidences that the specs are equivocal.

BTW - I didn't downvote yours or others' similar interpretation of "unique;" I merely commented on it.

[blue_cowdawg]

your code would not show "F"

Did you actually try the code? I did. Depending on your definition of unique there are ways of tweeking that code so that I show each letter exactly once. Or I could show you the letters that are seen more than once. Or only once.