Added get-maze-path problem and added complexities in previous problems

Author: navneet

src/_Problems_/get-mazePath/index.js

@@ -0,0 +1,42 @@
+//======================================Problem Statement=============================================
+// --->> Print all possible path to reach the end of the GRID/MAZE (N x N) from starting  point to ending point
+// --->> One horizontal move will be represented by H and one vertical move will be represented by V
+// --->> Complexity =  Complexity will be exponential as there are many overlapping solutions
+// --->> cr = current row
+// --->> cc = current column
+// --->> er = end row
+// --->> ec = end column
+
+
+
+
+let getMazePath = (cr, cc, er, ec) => {
+    if(cr == er && cc == ec) {              //============POSITIVE BASE CASE===========
+        let br = [];
+        br.push('');
+        return br;
+    }
+    
+    if(cr > er || cc > ec) {                //============NEGATIVE BASE CASE===========
+        let br = [];
+        return br;
+    }
+    
+    let myResult = [];
+    
+    let recResultH = getMazePath(cr, cc + 1, er, ec);
+    recResultH.forEach((rrh) => {
+        myResult.push("H" + rrh);
+    });
+    
+    let recResultV = getMazePath(cr + 1, cc, er, ec);
+    recResultV.forEach((rrv) => {
+        myResult.push("V" + rrv);
+    }); 
+    
+    return myResult;
+}
+
+
+let path = getMazePath(0, 0, 2, 2);
+console.log(path);

src/_Problems_/getStringPermutation

@@ -3,6 +3,7 @@
 // SUBSTRING OF 'bc'  ---->>>>  ['', 'b', 'c', 'bc']
 // SUBSTRING OF 'c'   ---->>>>  ['', 'c']
 // A pattern can be noticed in above three substrings. Technique followed is recursion.
+// Time complexity : O(2^n)  n is the length of the string provided.
 
 
 let getSubesequence = (str) => {
@@ -25,4 +26,5 @@ let getSubesequence = (str) => {
 
 
 let subsequence = getSubesequence('abc');
-console.log(subsequence);
+console.log(subsequence);
+