title: Efficiently finding the intersection of a variable number of sets of strings
body: <p>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 don't want any code, just ideas on what could be efficient. I have an implementation that I'm about to start coding but want to hear some other ideas.</p>
  
  <p>Currently, just thinking about my solution, it looks like I should have an asymptotic run-time of &#920;(n<sup>2</sup>).</p>
  
  <p>Thanks for any help!</p>
  
  <p>tshred</p>
  
  <p>Edit: To clarify, I really just want to know is there a faster way to do it. Faster than &#920;(n<sup>2</sup>).</p>