title: Fastest way to check if a list is present in a list of lists
body: <p>I have a list  </p>
  
  <pre><code>a=[[1,2,3,4,5,6],[7,8,9,10,11,12]]   
  </code></pre>
  
  <p>What is the fastest way to check if any list in <code>a</code> is present in another list of lists <code>b</code>, where   </p>
  
  <pre><code>b=[[5, 9, 25, 31, 33, 36],[7,8,9,10,11,12],[10, 13, 22, 24, 33, 44]]
  </code></pre>
  
  <p>If any list in a is present in b, I would like to remove it. I'm currently using this code:</p>
  
  <pre><code>for each in a:
      for item in b:
          if set(each).issubset(item)
              a.remove(each)
  </code></pre>
  
  <p>This works but is quite slow when working with large lists so was wondering if there's a better way. The above code gives me the following result:</p>
  
  <pre><code>print(a)
  [[1, 2, 3, 4, 5, 6]]
  </code></pre>
  
  <p>I am not worried about order, for example if a list in <code>a</code>is <code>[1,2,3,4,5,6]</code> I want it to be removed if there exist a list <code>[1,2,3,4,5,6]</code> or <code>[3,4,1,6,2,5]</code> etc in list <code>b</code>.</p>