Commit 2073100

@@ -0,0 +1,47 @@
+description = <<-DOC
+Given an array of points on a 2D plane, find the maximum number of points that are visible from point (0, 0) with a viewing angle that is equal to 45 degrees.
+
+Example
+
+For
+
+  points = [[1, 1], [3, 1], [3, 2], [3, 3],
+            [1, 3], [2, 5], [1, 5], [-1, -1],
+            [-1, -2], [-2, -3], [-4, -4]]
+the output should be visiblePoints(points) = 6.
+
+This visualization shows how these 6 points can be viewed:
+
+
+
+Input/Output
+
+[time limit] 4000ms (rb)
+[input] array.array.integer points
+
+The array of points. For each valid i, points[i] contains exactly 2 elements and represents the ith point, where points[i][0] is the x-coordinate and points[i][1] is the y-coordinate. It is guaranteed that there are no points located at (0, 0) and there are no two points located at the same place.
+
+Guaranteed constraints:
+1 ≤ points.length ≤ 105,
+1 ≤ points[i].length = 2,
+-107 ≤ points[i][j] ≤ 107.
+
+[output] integer
+
+The maximum number of points that can be viewed from point (0, 0) with a viewing angle that is equal to 45 degrees.
+DOC
+
+describe "visible points" do
+  def visible_points(points)
+  end
+
+  it do
+    points = [[1, 1], [3, 1], [3, 2], [3, 3], [1, 3], [2, 5], [1, 5], [-1, -1], [-1, -2], [-2, -3], [-4, -4]]
+    expect(visible_points(points)).to eql(6)
+  end
+
+  #it do
+    #points = [[1,1], [3,1], [3,2], [3,3], [1,3], [2,5], [1,5], [-1,-1], [-1,-2], [-2,-3], [-4,-4]]
+    #expect(visible_points(points)).to eql(6)
+  #end
+end