RAT CHEESE MAZE

 Coding Problem Keys 

 RAT CHEESE MAZE 

 Problem Statement 

Moozak the mouse has been placed in the top left corner of a maze. There is a huge chunk of cheese somewhere in the maze which is represented by 9. The maze is represented as a matrix of integers, where 0 denotes a wall, 1 denotes a path and 9 represents the huge chunk of cheese.

Fill in the lines of code for the method isPath to determine if Moozak can reach the huge chunk of cheese. The method should return 1 if there is a path from Moozak (top left corner) to the cheese. The method isPath must return 0 if there is no path. Moozak cannot climb the walls or go out of the maze but can go left, right, up or down.

 Input Format 

The first line contains 8 integer values (one among 0, 1 or 9) separated by a space.

 Output Format 

The first line contains either 1 or 0

 Example Input/Output 1 

 Input 

1 0 1 1 1 0 0 1

1 0 0 0 1 1 1 1

1 0 0 0 0 0 0 0

1 0 1 0 9 0 1 1

1 1 1 0 1 0 0 1

1 0 1 0 1 1 0 1

1 0 0 0 0 1 0 1

1 1 1 1 1 1 1 1

 Output 

1

 Explanation 

The path to cheese is mentioned using *

* 0 1 1 1 0 0 1
* 0 0 0 1 1 1 1
* 0 0 0 0 0 0 0
* 0 1 0 9 0 1 1
* 1 1 0 * 0 0 1
* 0 1 0 * * 0 1
* 0 0 0 0 * 0 1
* * * * * * 1 1

 Example Input/Output 2 

 Input 

1 0 9 1 0 0 0 1

1 0 0 0 1 1 1 1

1 0 0 0 0 0 0 0

1 0 1 0 0 0 1 1

1 1 1 0 1 0 0 1

1 0 1 0 1 1 0 1

1 0 0 0 0 1 0 1

1 1 1 1 1 1 1 1

 Output 

0

 Max Execution Time Limit: 4000 millisecs 

 Solution 

 Programming Language: JAVA Language 

private static int isPath(int maze[][]){
    if(iterate(maze,0,0)==true)){
        return 1;
    }else{
        return 0;
    }
}
private static boolean iterate(int maze[][],int i,int j){
    if(i>=0 && j>=0 && i<8 && j<8){
        if(maze[i][j]==9){
             return true;
        }
        if(maze[i][j]!=1){
             return false;
        }
        if maze[i][j]==1){
             maze[i][j]=2;
        }
        if(iterate(maze,i+1,j))
        return true;
        if(iterate(maze,i-1,j))
        return true;
        if(iterate(maze,i,j+1))
        return true;
	if(iterate(maze,i,j-1))
        return true;
    }
    return false;
}

// Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.)