From 7aa0b7be6f50340cc2ef17ac36d8f63bfe6da4db Mon Sep 17 00:00:00 2001
From: Yashkumar Gupta <50690622+yashh1234@users.noreply.github.com>
Date: Wed, 30 Nov 2022 18:12:45 +0530
Subject: [PATCH] chore(CPlusPlus): add rat in a maze problem (#1051)

Co-authored-by: Arsenic <54987647+Arsenic-ATG@users.noreply.github.com>
---
 .../Backtracking/rat-in-a-maze-problem.cpp    | 60 +++++++++++++++++++
 algorithms/CPlusPlus/README.md                |  1 +
 2 files changed, 61 insertions(+)
 create mode 100644 algorithms/CPlusPlus/Backtracking/rat-in-a-maze-problem.cpp

diff --git a/algorithms/CPlusPlus/Backtracking/rat-in-a-maze-problem.cpp b/algorithms/CPlusPlus/Backtracking/rat-in-a-maze-problem.cpp
new file mode 100644
index 00000000..0be8f73e
--- /dev/null
+++ b/algorithms/CPlusPlus/Backtracking/rat-in-a-maze-problem.cpp
@@ -0,0 +1,60 @@
+#include<iostream>
+using namespace std;
+
+bool issafe(int** arr, int x, int y, int n){
+    if(x<n && y<n && arr[x][y]==1){
+        return true;
+    }
+    return false;
+}
+bool ratinMaze(int** arr, int x, int y, int n, int** solArr){
+    if(x==n-1 && y==n-1){
+        solArr[x][y]=1;
+        return true;
+    }
+    if(issafe(arr, x, y, n)){
+        solArr[x][y]=1;
+        if(ratinMaze(arr, x+1, y, n, solArr)){
+            return true;
+        }
+        if(ratinMaze(arr, x, y+1, n, solArr)){
+            return true;
+        }
+        solArr[x][y]=0;
+        return false;
+    }
+    return false;
+}
+
+int main(){
+    int n;
+    cin>>n;
+    int** arr=new int*[n];
+    for(int i=0; i<n; i++){
+        arr[i]=new int[n];
+    }
+    for(int i=0; i<n; i++){
+        for(int j=0; j<n; j++){
+            cin>>arr[i][j];
+        }
+    }
+    int** solArr=new int*[n];
+    for(int i=0; i<n; i++){
+        solArr[i] = new int[n];
+        for(int j=0; j<n; j++){
+            solArr[i][j]=0;
+        }
+    }
+    if(ratinMaze(arr, 0, 0, n, solArr)){
+        for(int i=0; i<n; i++){
+        for(int j=0; j<n; j++){
+            cout<<solArr[i][j];
+        }cout<<endl;
+
+        }
+    }
+    return 0;
+}
+
+/* Time complexity: O(2^(n^2)). The recursion can run upper-bound 2^(n^2) times.
+   Space Complexity: O(n^2). Output matrix is required so an extra space of size n*n is needed. */
diff --git a/algorithms/CPlusPlus/README.md b/algorithms/CPlusPlus/README.md
index 9f7ac05a..5fc38d40 100644
--- a/algorithms/CPlusPlus/README.md
+++ b/algorithms/CPlusPlus/README.md
@@ -216,3 +216,4 @@
 ## Backtracking
 
 - [N-Queens Problem](Backtracking/n-queens.cpp)
+- [Rat In A Maze Problem](Backtracking/rat-in-a-maze-problem.cpp)