Implementing an efficent algorithm to find the intersection of two strings

Question

Implement an algorithm that takes two strings as input, and returns the intersection of the two, with each letter represented at most once.

Answer 1

How about this ...

var s1 = "aabbccccffffd";
var s2 = "aabc";

var ans = s1.Intersect(s2);