solves valid boomerang

Author: anishLearnsToCode

README.md

@@ -280,7 +280,7 @@
 | 1025 | [Divisor Game](https://leetcode.com/problems/divisor-game)                                                                                           |                                                              [![Java](assets/java.png)](src/DivisorGame.java)                                                               |                                                                                                                                   |
 | 1029 | [Two City Scheduling](https://leetcode.com/problems/two-city-scheduling)                                                                             |                                                                                                                                                                             |                                                                                                                                   |
 | 1030 | [Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order)                                                       |                                                       [![Java](assets/java.png)](src/MatrixCellsInDistanceOrder.java)                                                       |                                                                                                                                   |
-| 1033 | [Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive)                                                     |                                                                                                                                                                             |                                                                                                                                   |
+| 1033 | [Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive)                                                     |                                                             [![Java](assets/java.png)](src/ValidBoomerang.java)                                                             |                                                                                                                                   |
 | 1037 | [Valid Boomerang](https://leetcode.com/problems/valid-boomerang)                                                                                     |                                                                                                                                                                             |                                                                                                                                   |
 | 1042 | [Flower Planting with no Adjacent](https://leetcode.com/problems/flower-planting-with-no-adjacent)                                                   |                                                                                                                                                                             |                                                                                                                                   |
 | 1046 | [Last Stone Weight](https://leetcode.com/problems/last-stone-weight)                                                                                 |                                                                                                                                                                             |                                                                                                                                   |

src/ValidBoomerang.java

@@ -0,0 +1,40 @@
+import java.util.Objects;
+
+public class ValidBoomerang {
+    public boolean isBoomerang(int[][] points) {
+        Position p1 = Position.from(points[0]);
+        Position p2 = Position.from(points[1]);
+        Position p3 = Position.from(points[2]);
+        if (p1.equals(p2) || p2.equals(p3) || p3.equals(p1)) return false;
+        if (p1.x == p2.x) return p3.x != p2.x;
+        if (p2.x == p3.x) return true;
+        return (p2.y - p1.y) * (p3.x - p2.x) != (p3.y - p2.y) * (p2.x - p1.x);
+    }
+
+    private final static class Position {
+        private final int x;
+        private final int y;
+
+        private static Position from(int[] array){
+            return new Position(array[0], array[1]);
+        }
+
+        Position(int x, int y) {
+            this.x = x;
+            this.y = y;
+        }
+
+        @Override
+        public boolean equals(Object o) {
+            if (this == o) return true;
+            if (o == null || getClass() != o.getClass()) return false;
+            Position position = (Position) o;
+            return x == position.x && y == position.y;
+        }
+
+        @Override
+        public int hashCode() {
+            return Objects.hash(x, y);
+        }
+    }
+}