title: To find the minimum(least) number of Unique numbers in a given list after 'n' reductions
body: <p>Problem Statement: <em>To find the minimum(least) number of Unique numbers in a given list after 'n' reductions</em></p>
  
  <p>Input:</p>
  
  <pre><code>N and an Array(or list)
  
  Where 0 &lt; N &lt; len(Array)
  </code></pre>
  
  <p>N is the number of reductions possible  and the input for the array needs to be separated by commas(,)</p>
  
  <p>Example 1:</p>
  
  <pre><code>N = 2
  
  Array = 1, 2, 3, 3, 4, 4
  </code></pre>
  
  <p>Output: 
  To find the Least or minimum number of unique elements after deleting N number of elements in the Array</p>
  
  <p>In the above example,
  After deleting N = 2 number of elements from the Array</p>
  
  <p>In the above example 1, 2 should be deleted from the array
           3, 3, 4, 4 will be remaining
  So, 2 unique elements remaining after deleting 2 elements from the array</p>
  
  <p>So, the output should be 2</p>
  
  <p>Example 2: </p>
  
  <pre><code>N = 2 [ number of reductions possible]
  
  Input Array : 1,3,4,1,2,4,2,2 
  
  Output: 3 [least number of unique elements] 
  </code></pre>
  
  <p>Explanation :[1,1,2,2,4,4] will be the resultant array when [2,3] are removed</p>
  
  <p>Supposed to be coded in Python exclusively but solutions in any language will be appreciated.</p>