Word breaking problem added

Author: suren-rjs

WordBreakProblem/WordBreakProblem.iml

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+ <component name="NewModuleRootManager" inherit-compiler-output="true">
+ <exclude-output />
+ <content url="file://$MODULE_DIR$">
+ <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+ </content>
+ <orderEntry type="inheritedJdk" />
+ <orderEntry type="sourceFolder" forTests="false" />
+ </component>
+</module>

WordBreakProblem/src/WordBreaking.java

@@ -0,0 +1,45 @@
+import java.util.Arrays;
+import java.util.List;
+
+public class WordBreaking {
+ public static void main(String[] args) {
+ String str = "iloveicecreamandmango";
+
+ List<String> dict =
+ Arrays.asList(
+ "mobile",
+ "samsung",
+ "sam",
+ "sung",
+ "man",
+ "mango",
+ "icecream",
+ "and",
+ "go",
+ "i",
+ "love",
+ "ice",
+ "cream");
+ System.out.println("First Test:");
+
+ wordBreakingUtil(str.length(), dict, str);
+ }
+
+ private static void wordBreakingUtil(int length, List<String> dict, String str) {
+ String ans = "";
+ FindAndAddBreaks(length, dict, str, ans);
+ }
+
+ private static void FindAndAddBreaks(int length, List<String> dict, String str, String ans) {
+ for (int i = 1; i <= length; i++) {
+ String word = str.substring(0, i);
+ if (dict.contains(word)) {
+ if (i == length) {
+ System.out.println(ans + word);
+ break;
+ }
+ FindAndAddBreaks(length - i, dict, str.substring(i, length), ans + word + " ");
+ }
+ }
+ }
+}

findShortestPathInMaze/src/GetAllPathsRecursionApproach.java

@@ -0,0 +1,23 @@
+import java.util.ArrayList;
+import java.util.List;
+
+public class GetAllPathsRecursionApproach {
+ public static void main(String[] args) {
+ int[][] mat = {{1, 2, 3}, {0, 10, 6}};
+ List<Integer> path = new ArrayList<>();
+ if (mat[0][0] == 0 || mat[mat.length - 1][mat[0].length - 1] == 0) {
+ System.out.println("No Path Available");
+ return;
+ }
+ findAllValidPaths(mat, 0, 0, path);
+ }
+
+ private static void findAllValidPaths(int[][] mat, int x, int y, List<Integer> path) {
+ if (x > mat.length - 1 || y > mat[0].length - 1 || mat[x][y] == 0) return;
+ path.add(mat[x][y]);
+ if (x == mat.length - 1 && y == mat[0].length - 1) System.out.println(path);
+ findAllValidPaths(mat, x + 1, y, path);
+ findAllValidPaths(mat, x, y + 1, path);
+ path.remove(path.size() - 1);
+ }
+}

findShortestPathInMaze/src/pathFromCornerToMiddleInMaze.java

@@ -0,0 +1,35 @@
+public class pathFromCornerToMiddleInMaze {
+
+ public static void main(String[] args) {
+
+ int[][] maze = {
+ {3, 5, 4, 4, 7, 3, 4, 6, 3},
+ {6, 7, 5, 6, 6, 2, 6, 6, 2},
+ {3, 3, 4, 3, 2, 5, 4, 7, 2},
+ {6, 5, 5, 1, 2, 3, 6, 5, 6},
+ {3, 3, 4, 3, 0, 1, 4, 3, 4},
+ {3, 5, 4, 3, 2, 2, 3, 3, 5},
+ {3, 5, 4, 3, 2, 6, 4, 4, 3},
+ {3, 5, 1, 3, 7, 5, 3, 6, 4},
+ {6, 2, 4, 3, 4, 5, 4, 5, 1}
+ };
+
+ printPathForGivenMaze(maze, 0, 0, "");
+ }
+
+ private static void printPathForGivenMaze(int[][] maze, int x, int y, String s) {
+ if (x == maze.length / 2 && y == maze.length / 2) {
+ s += "(" + x + ", " + y + ") -> Mid";
+ System.out.println(s);
+ return;
+ }
+ if (maze[x][y] == 0) return;
+ int k = maze[x][y];
+ maze[x][y] = 0;
+ if (y + k < maze.length) printPathForGivenMaze(maze, x, y + k, s + "(" + x + ", " + y + ") ->");
+ if (x + k < maze.length) printPathForGivenMaze(maze, x + k, y, s + "(" + x + ", " + y + ") ->");
+ if (y - k > 0) printPathForGivenMaze(maze, x, y - k, s + "(" + x + ", " + y + ") ->");
+ if (x - k > 0) printPathForGivenMaze(maze, x - k, y, s + "(" + x + ", " + y + ") ->");
+ maze[x][y] = k;
+ }
+}