add 2133

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2133|[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2133.java) ||Easy||
 |2130|[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2130.java) ||Medium||
 |2129|[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2129.java) ||Easy||
 |2126|[Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2126.java) ||Medium||

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

@@ -0,0 +1,33 @@
+package com.fishercoder.solutions;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _2133 {
+    public static class Solution1 {
+        public boolean checkValid(int[][] matrix) {
+            int n = matrix.length;
+            Set<Integer> set = new HashSet<>();
+            for (int i = 1; i <= n; i++) {
+                set.add(i);
+            }
+            for (int i = 0; i < n; i++) {
+                Set<Integer> copy = new HashSet<>(set);
+                for (int j = 0; j < n; j++) {
+                    if (!copy.remove(matrix[i][j])) {
+                        return false;
+                    }
+                }
+            }
+            for (int j = 0; j < n; j++) {
+                Set<Integer> copy = new HashSet<>(set);
+                for (int i = 0; i < n; i++) {
+                    if (!copy.remove(matrix[i][j])) {
+                        return false;
+                    }
+                }
+            }
+            return true;
+        }
+    }
+}