title: remove lists with same elements but in different order, from a list of lists
body: <p>I want to filter a list of lists for duplicates. I consider two lists to be a duplicate of each other when they contain the same elements but not necessarily in the same order. So for example</p>
  <pre><code>[['A', 'B', 'C'], ['C', 'B', 'A'], ['D', 'B', 'A']]
  </code></pre>
  <p>should become</p>
  <pre><code>[['A', 'B', 'C'], ['D', 'B', 'A']]
  </code></pre>
  <p>since <code>['C', 'B', 'A']</code> is a duplicate of <code>['A', 'B', 'C']</code>.
  It does not matter which one of the duplicates gets removed, as long as the final list of lists does not contain any duplicates anymore. And all lists need to keep the order of there elements. So using <code>set()</code> may not be an option.</p>
  <p>I found this related questions:
  <a href="https://stackoverflow.com/questions/8866652/determine-if-2-lists-have-the-same-elements-regardless-of-order">Determine if 2 lists have the same elements, regardless of order?</a> ,
  <a href="https://stackoverflow.com/questions/7828867/how-to-efficiently-compare-two-unordered-lists-not-sets">How to efficiently compare two unordered lists (not sets)?</a>
  But they only talk about how to compare two lists, not how too efficiently remove duplicates. I'm using python.</p>