for (int a = 0; a<sudokuArray.length; a++) {
		    	Set Row1 = new HashSet();
		    	for (int i = 0; i < sudokuArray.length; i++) {
		    		if(Row1.contains(sudokuArray[a][i])) {
		    			throw new IllegalArgumentException("Fel i raden");
		    		}
		    		else {
	    				if (sudokuArray[a][i] !=0) {
	    				Row1.add(sudokuArray[a][i]);
	    			}
	    		}
		    	}
		    }
		    for (int a = 0; a<sudokuArray.length; a++) {
		    	Set Col1 = new HashSet();
		    	for (int i = 0; i < sudokuArray.length; i++) {

		    		if(Col1.contains(sudokuArray[i][a])) {
		    			throw new IllegalArgumentException("Fel i kolumnen");
		    		}
		    		else {
	    				if (sudokuArray[i][a] !=0) {
	    				Col1.add(sudokuArray[i][a]);
	    			}
	    		}
		    	}
		    }

		    int squareRowMin=0;
		    int squareColMin=0;
		    int squareRowMax=3;
		    int squareColMax=3;


		    for (int a = 0; a<3; a++) {
		    	squareColMin = a*3;
		    	squareColMax = (a+1)*3;
		    for (int i = 0; i<3; i++) {
		    	squareRowMin = i*3;
		    	squareRowMax = (i+1)*3;
		    	checkSquare(squareRowMin, squareRowMax, squareColMin, squareColMax);

		    }
		    }



		    }