title: K-enclosing Minimum Area Square
body: <p>Asked during an interview.
  We are given N points on a 2-D plane <code>x[0],y[0].......x[n-1],y[n-1]</code> and an integer K.</p>
  
  <p>We need to find the minimum area Square,having integer coordinates as vertices with sides parallel to coordinate axis. enclosing atleast K of the given N points, with no point lying on the boundary of the square, i.e all K points should be strictly inside the square.</p>
  
  <p>I thought of classical minimum enclosing-rectangle problem, but couldn't derive the case for at least K points. How to approach this? Thanks in advance.</p>