使用相同字符查找最接近字符串的算法

Given a list L of n character strings, and an input character string S, what is an efficient way to find the character string in L that contains the most characters that exist in S? We want to find the string in L that is most-closely made up of the letters contained in S.Given a list L of n character strings, and an i