solves find nearest point that has same x ort y coordinate

Author: anishLearnsToCode

README.md

@@ -433,7 +433,7 @@
 | 1763 | [Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring)                                                                            |                                                              [![Java](assets/java.png)](src/LongestNiceSubstring.java)                                                               |                                                                                                                                   |
 | 1768 | [Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately)                                                                      |                                                             [![Java](assets/java.png)](src/MergeStringsAlternately.java)                                                             |                                                                                                                                   |
 | 1773 | [Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule)                                                                  |                                                             [![Java](assets/java.png)](src/CountItemsMatchingARule.java)                                                             |                                                                                                                                   |
-| 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)            |                                                                                                                                                                                      |                                                                                                                                   |
+| 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate)            |                                                  [![Java](assets/java.png)](src/FindNearestPointThatHasTheSameXOrYCoordinate.java)                                                   |                                                                                                                                   |
 | 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones)            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal)                          |                                                                                                                                                                                      |                                                                                                                                   |
 | 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph)                                                                      |                                                                                                                                                                                      |                                                                                                                                   |

src/FindNearestPointThatHasTheSameXOrYCoordinate.java

@@ -0,0 +1,20 @@
+public class FindNearestPointThatHasTheSameXOrYCoordinate {
+    public int nearestValidPoint(int x, int y, int[][] points) {
+        int minDistance = Integer.MAX_VALUE, minIndex = -1;
+        for (int index = 0 ; index < points.length ; index++) {
+            int[] point = points[index];
+            if (point[0] == x || point[1] == y) {
+                int distance = manhattanDistance(x, y, point);
+                if (distance < minDistance) {
+                    minDistance = distance;
+                    minIndex = index;
+                }
+            }
+        }
+        return minIndex;
+    }
+
+    private int manhattanDistance(int x, int y, int[] point) {
+        return Math.abs(x - point[0]) + Math.abs(y - point[1]);
+    }
+}