add 2596

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
+| 2596 |[Check Knight Tour Configuration](https://leetcode.com/problems/check-knight-tour-configuration/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2596.java)                                                                     |                                                                               | Medium                           |
 | 2595 |[Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2595.java)                                                                     |                                                                               | Easy                             |
 | 2586 |[Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2586.java)                                                                     |                                                                               | Easy                             |
 | 2583 |[Kth Largest Sum in a Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2583.java)                                                                     |                                                                               | Medium                           |

src/main/java/com/fishercoder/solutions/_2596.java

@@ -0,0 +1,40 @@
+package com.fishercoder.solutions;
+
+public class _2596 {
+    public static class Solution1 {
+        public boolean checkValidGrid(int[][] grid) {
+            int n = grid.length;
+            int[][] offsets = new int[][]{
+                    {-2, 1},
+                    {-1, 2},
+                    {1, 2},
+                    {2, 1},
+                    {2, -1},
+                    {1, -2},
+                    {-1, -2},
+                    {-2, -1}
+            };
+            int x = 0;
+            int y = 0;
+            int currentVal = 0;
+            while (currentVal != n * n - 1) {
+                boolean foundNext = false;
+                for (int[] offset : offsets) {
+                    int newX = x + offset[0];
+                    int newY = y + offset[1];
+                    if (newX >= 0 && newX < n && newY >= 0 && newY < n && grid[newX][newY] == currentVal + 1) {
+                        currentVal++;
+                        x = newX;
+                        y = newY;
+                        foundNext = true;
+                        break;
+                    }
+                }
+                if (!foundNext) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}