solves path crossing

Author: anishLearnsToCode

README.md

@@ -1,7 +1,7 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-282/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-282/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-304/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-304/2081-1abc9c.svg)
 ![problems-solved-python](https://img.shields.io/badge/Python-186/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
@@ -379,7 +379,7 @@
 | 1480 | [Running Sum of 1D Array](https://leetcode.com/problems/running-sum-of-1d-array)                                                                     |                                                               [![Java](assets/java.png)](src/RunningSumOf1DArray.java)                                                               |                                                                                                                                   |
 | 1486 | [XOR Operations in An Array](https://leetcode.com/problems/xor-operation-in-an-array)                                                                |                                                              [![Java](assets/java.png)](src/XOROperationInAnArray.java)                                                              |                                                                                                                                   |
 | 1491 | [Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary)     |                                                [![Java](assets/java.png)](src/AverageSalaryExcludingTheMinimumAndMaximumSalary.java)                                                 |                                                                                                                                   |
-| 1496 | [Path Crossing](https://leetcode.com/problems/path-crossing)                                                                                         |                                                                                                                                                                                      |                                                                                                                                   |
+| 1496 | [Path Crossing](https://leetcode.com/problems/path-crossing)                                                                                         |                                                                  [![Java](assets/java.png)](src/PathCrossing.java)                                                                   |                                                                                                                                   |
 | 1502 | [Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence)                         |                                                                                                                                                                                      |                                                                                                                                   |
 | 1507 | [Reformat Date](https://leetcode.com/problems/reformat-date)                                                                                         |                                                                                                                                                                                      |                                                                                                                                   |
 | 1512 | [Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs)                                                                           |                                                                                                                                                                                      |                                                                                                                                   |

src/PathCrossing.java

@@ -0,0 +1,46 @@
+import java.util.HashSet;
+import java.util.Objects;
+import java.util.Set;
+
+public class PathCrossing {
+    public boolean isPathCrossing(String path) {
+        Set<Point> visitedPoints = new HashSet<>();
+        visitedPoints.add(new Point(0, 0));
+        for (int index = 0, x = 0, y = 0 ; index < path.length() ; index++) {
+            switch (path.charAt(index)) {
+                case 'N' -> y++;
+                case 'E' -> x++;
+                case 'S' -> y--;
+                case 'W' -> x--;
+            }
+            Point newPosition = new Point(x, y);
+            if (visitedPoints.contains(newPosition)) return true;
+            visitedPoints.add(newPosition);
+        }
+        return false;
+    }
+
+    private static final class Point {
+        private final int x;
+        private final int y;
+
+        private Point(int x, int y) {
+            this.x = x;
+            this.y = y;
+        }
+
+        @Override
+        public boolean equals(Object obj) {
+            if (obj == this) return true;
+            if (obj == null || obj.getClass() != this.getClass()) return false;
+            var that = (Point) obj;
+            return this.x == that.x &&
+                    this.y == that.y;
+        }
+
+        @Override
+        public int hashCode() {
+            return Objects.hash(x, y);
+        }
+    }
+}