Create mazepath(HV)(D->D).java

Take as input N. N is the number of rows and columns on a square board. Our player starts in top-left corner of the board and must reach bottom-right corner. In one move the player can move 1 step horizontally (right) or 1 step vertically (down) or 1 step diagonally (south-east). But the diagonal step is allowed only when the player is currently on one of the diagonals (there are two diagonals)

a. Write a recursive function which returns the count of different ways the player can travel across the board. Print the value returned.

b. Write a recursive function which prints moves for all valid paths across the board (void is the return type for function).

Input Format
Enter the number N.

Constraints
None

Output Format
Display the total number of paths and display all the possible paths in a space separated manner.

Sample Input
3
Sample Output
VVHH VHVH VHHV VHD HVVH HVHV HVD HHVV DVH DHV DD 
11

Author: Gopal868484

Recursion/mazepath(HV)(D->D).java

@@ -0,0 +1,30 @@
+import java.util.*;
+public class Main {
+    static int count;
+	public static void printPath(int cr, int cc, int er, int ec, String path) {
+		if(cr > er || cc > ec) {
+			
+			return;
+		}
+		
+		if(cr == er && cc == ec) {
+			count++;
+			System.out.print(path + " ");
+			return;
+		}
+		printPath(cr + 1, cc, er, ec, path + 'V');
+		printPath(cr, cc + 1, er, ec, path + 'H');
+        if (cr==cc || cr==er-cc){
+        printPath(cr + 1, cc+1, er, ec, path + 'D');
+        }
+        
+	}
+    public static void main(String args[]) {
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        printPath(0, 0, n-1, n-1, "");
+        System.out.println();
+		System.out.println(count);
+        
+    }
+}