| # | 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||

packagecom.fishercoder.solutions;

importjava.util.HashSet;

importjava.util.Set;

publicclass_2133 {

publicstaticclassSolution1 {

publicbooleancheckValid(int[][]matrix) {

intn =matrix.length;

Set<Integer>set =newHashSet<>();

for (inti =1;i <=n;i++) {

set.add(i);

}

for (inti =0;i <n;i++) {

Set<Integer>copy =newHashSet<>(set);

for (intj =0;j <n;j++) {

if (!copy.remove(matrix[i][j])) {

returnfalse;

}

}

}

for (intj =0;j <n;j++) {

Set<Integer>copy =newHashSet<>(set);

for (inti =0;i <n;i++) {

if (!copy.remove(matrix[i][j])) {

returnfalse;

}

}

}

returntrue;

}

}

}