deletions | additions       diff --git a/Smallest_Triangles_A_triangle_s__.md b/Smallest_Triangles_A_triangle_s__.md  index c9f0e2a..90423c7 100644  --- a/Smallest_Triangles_A_triangle_s__.md  +++ b/Smallest_Triangles_A_triangle_s__.md 
...
2. Our algorithm finds the closest point to all intervals on the left- and right-hand side.  3. For an interval, the closest point of these two must be the closest point in the whole plane. This is the value we return \(\square\).  ## Addendum  Just thought I'd let you know; After emailing you about ambiguity in the original question, I proceeded to totally misread the updated version. I spent like four hours working out an algorithm for determining the smallest triangle for each _point_. It's a much more challenging question.