Simplified Sudoku

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class Viikko2e {

    static class FastReader {

        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void main(String[] args) {

        FastReader s = new FastReader();
        int n = s.nextInt();

        int[][] sudoku = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                int a = s.nextInt();
                if (a > n) {
                    System.out.println("NO");
                    break;
                }
                sudoku[i][j] = a;
            }
        }

        if (tarkista(n, sudoku)) {
            System.out.println("YES");
        } else {
            System.out.println("NO");
        }

    }

    private static boolean tarkista(int n, int[][] sudoku) {
        Set<Integer> setti = new HashSet<>();
        
        for (int i = 0; i < n; i++) {
            for (int j = 0; i < n; i++) {
                int a = sudoku[i][j];
                if (setti.contains(a)) {
                    return false;
                }
                setti.add(a);
            }
            setti.clear();
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; i < n; i++) {
                int a = sudoku[j][i];
                if (setti.contains(a)) {
                    return false;
                }
                setti.add(a);
            }
        }
        return true;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: WRONG ANSWER