title: Find all possible subset combos in an array?
body: <p>I need to get all possible subsets of an array with a minimum of <code>2</code> items and an unknown maximum. Anyone that can help me out a bit?</p>
  <p>Say I have the following array:</p>
  <pre><code>[1, 2, 3]
  </code></pre>
  <p>How do I get this?</p>
  <pre><code>[
      [1, 2],
      [1, 3],
      [2, 3],
      [1, 2, 3]
  ]
  </code></pre>