title: How to check if a list is a subset of another list (with tolerance)
body: <p>I'm trying to solve a problem that involves the figuring out if one list is a subset of another, except there is an added twist that the code should consider the list a subset even if the values don't completely match, as long as it's within a tolerance.</p>
  <p>EXAMPLE:</p>
  <p>If I have the lists:</p>
  <pre><code>A = [0.202, 0.101]
  B = [0.1, 0.2, 0.3, 0.4, 0.5]
  </code></pre>
  <p>and I set a tolerance of <code>tol = 0.002</code>, then the code should return that list <code>A</code> is a subset of list <code>B</code> since its values are within the tolerance (<code>0.202 &lt;= 0.2 + tol</code>, <code>0.101 &lt;= 0.1 + tol</code>).</p>
  <p>I don't have much code to show since I know how to figure out if a list is a subset of another using the traditional <code>issubset</code> function, but I'm not sure how to incorporate the tolerance into it.</p>