Merge pull request #226 from chirag2506/SnakeLadderBoardPathJavaCode

Added my profile into readme.md and added a JAVA code

README.md

@@ -392,6 +392,13 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
 - Lover of programming, drums, cars, ping-pong and anime.
 - [![github-alt][github-img]](https://github.com/costassolla)
 
+### Chirag Gupta  
+- First Year Student
+- Interested in development, machine learning.
+- Lover of programming, Greek mythology, Marvel.
+- [![github-alt][github-img]](https://github.com/chirag2506)
+  [![twitter-alt][twitter-img]](https://twitter.com/chiraggupta2506)
+
 ### CohheeTime
 
 - I built my first website in 1999

code/BoardPath.java

@@ -0,0 +1,37 @@
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class getBoardPath {
+
+	public static void main(String[] args) {
+		Scanner scn = new Scanner(System.in);
+        System.out.println("Enter Current Position:");
+        int n1= scn.nextInt();
+        System.out.println("Enter Destination Position:");
+        int n2= scn.nextInt();
+		System.out.println(GetBoardPath(n1, n2));
+
+	}
+
+	public static ArrayList<String> GetBoardPath(int curr, int end) {
+// Returns all snake & ladder board paths from curr to end
+		if (curr == end) {
+			ArrayList<String> basePositive = new ArrayList<>();
+			basePositive.add("\n");
+			return basePositive;
+		}
+		if (curr > end) {
+			ArrayList<String> baseNegative = new ArrayList<>();
+			return baseNegative;
+		}
+		ArrayList<String> MyResult = new ArrayList<>();
+		for (int dice = 1; dice <= 6; dice++) {
+			ArrayList<String> RecResult = GetBoardPath(curr + dice, end);
+			for (String RecResultString : RecResult) {
+				MyResult.add(dice + RecResultString);
+			}
+		}
+		return MyResult;
+	}
+
+}