Hacktoberfest2024
Hacktoberfest2024 copied to clipboard
Added RatInAMaze.java program
Problem
-In this problem, there is a given maze of size N x N. The source and the destination location is top-left cell and bottom right cell respectively. Some cells are valid to move and some cells are blocked. If one rat starts moving from start vertex to destination vertex, we have to find that is there any way to complete the path, if it is possible then mark the correct path for the rat.
Solution
-I have added java solution for the same problem stated above.
Changes proposed in this Pull Request :
-
1.
Added RatInAMaze.java file for the same.