Efficiently finding the intersection of a variable number of sets of strings

Question

I have a variable number of ArrayList\'s that I need to find the intersection of. A realistic cap on the number of sets of strings is probably around 35 but could be more. I

Answer 1

Sort them (n lg n) and then do binary searches (lg n).