Added more coding assessments and their solutions

Updated package structure

Author: kanahaiya

InterviewsPreparation/.classpath

@@ -1,12 +1,12 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <classpath>
-	<classpathentry kind="src" output="target/classes" path="src/main/java">
+	<classpathentry kind="src" output="target/test-classes" path="src/test/java">
 		<attributes>
 			<attribute name="optional" value="true"/>
 			<attribute name="maven.pomderived" value="true"/>
 		</attributes>
 	</classpathentry>
-	<classpathentry kind="src" output="target/test-classes" path="src/test/java">
+	<classpathentry kind="src" output="target/classes" path="src/main/java">
 		<attributes>
 			<attribute name="optional" value="true"/>
 			<attribute name="maven.pomderived" value="true"/>

InterviewsPreparation/.project

@@ -1,6 +1,6 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <projectDescription>
-	<name>InterviewsPreparation</name>
+	<name>Interviews-Preparation</name>
 	<comment></comment>
 	<projects>
 	</projects>

InterviewsPreparation/src/main/java/com/javaaid/ip/ca/TheLightStore.java

@@ -0,0 +1,39 @@
+/**
+ * 
+ */
+package com.javaaid.ip.ca;
+
+import java.util.Scanner;
+
+/**
+ * @author Kanahaiya Gupta
+ *
+ */
+public class TheLightStore {
+
+	private static int getOpCount(String str1, String str2) {
+		int dp[][] = new int[str1.length() + 1][str2.length() + 1];
+		for (int i = 0; i <= str1.length(); i++) {
+			for (int j = 0; j <= str2.length(); j++) {
+				if (i == 0)
+					dp[i][j] = j;
+				else if (j == 0)
+					dp[i][j] = i;
+				else if (str1.charAt(i - 1) == str2.charAt(j - 1))
+					dp[i][j] = dp[i - 1][j - 1];
+				else {
+					dp[i][j] = 1 + Math.min(dp[i - 1][j], Math.min(dp[i][j - 1], dp[i - 1][j - 1]));
+				}
+			}
+		}
+		return dp[str1.length()][str2.length()];
+	}
+
+	public static void main(String args[]) throws Exception {
+		Scanner sc = new Scanner(System.in);
+		String input = sc.next();
+		String output = sc.next();
+		int result = getOpCount(input, output);
+		System.out.println(result);
+	}
+}

InterviewsPreparation/src/main/java/com/javaaid/interviews/preparation/cleartrip/StringChain.java renamed to InterviewsPreparation/src/main/java/com/javaaid/ip/cleartrip/StringChain.java

@@ -1,75 +1,75 @@
-/**
- * 
- */
-package com.javaaid.interviews.preparation.cleartrip;
-
-import java.util.Scanner;
-
-/**
- * @author Kanahaiya Gupta
- *
- */
-public class StringChain {
-
-	static int charCount = 0;
-
-	public static void main(String[] args) {
-		Scanner sc = new Scanner(System.in);
-		/*int N = sc.nextInt();
-		String words[] = new String[N];
-		for (int i = 0; i < N; i++) {
-			words[i] = sc.next();
-		}*/
-        String[] words = new String[]{"a", "b","ba", "bca", "bda", "bdca"};
-
-		int result = calulateLongestChain(words);
-		System.out.println(result);
-		sc.close();
-	}
-
-	/**
-	 * @param words
-	 * @return
-	 */
-	private static int calulateLongestChain(String[] words) {
-		int maxLongestChainOfCharacter = 0;
-		for (String word : words) {
-			int currentCharCount= findMaxChain(words, word, 0);
-			maxLongestChainOfCharacter = Math.max(maxLongestChainOfCharacter, currentCharCount);
-
-		}
-		return maxLongestChainOfCharacter;
-	}
-
-	/**
-	 * @param word
-	 * @return
-	 */
-	private static int findMaxChain(String[] words, String word, int lenCounter) {
-		if (!wordsContains(words, word)) {
-			return 0;
-		}
-		lenCounter++;
-		charCount = lenCounter;
-		for (int i = 0; i < word.length(); i++) {
-			StringBuilder sb = new StringBuilder(word);
-			sb.delete(i, i + 1);
-			findMaxChain(words, sb.toString(), lenCounter);
-		}
-		return charCount;
-	}
-
-	/**
-	 * @param string
-	 * @return
-	 */
-	private static boolean wordsContains(String[] words, String string) {
-		for (String word : words) {
-			if (word.equals(string)) {
-				return true;
-			}
-		}
-		return false;
-	}
-
-}
+/**
+ * 
+ */
+package com.javaaid.ip.cleartrip;
+
+import java.util.Scanner;
+
+/**
+ * @author Kanahaiya Gupta
+ *
+ */
+public class StringChain {
+
+	static int charCount = 0;
+
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		/*int N = sc.nextInt();
+		String words[] = new String[N];
+		for (int i = 0; i < N; i++) {
+			words[i] = sc.next();
+		}*/
+        String[] words = new String[]{"a", "b","ba", "bca", "bda", "bdca"};
+
+		int result = calulateLongestChain(words);
+		System.out.println(result);
+		sc.close();
+	}
+
+	/**
+	 * @param words
+	 * @return
+	 */
+	private static int calulateLongestChain(String[] words) {
+		int maxLongestChainOfCharacter = 0;
+		for (String word : words) {
+			int currentCharCount= findMaxChain(words, word, 0);
+			maxLongestChainOfCharacter = Math.max(maxLongestChainOfCharacter, currentCharCount);
+
+		}
+		return maxLongestChainOfCharacter;
+	}
+
+	/**
+	 * @param word
+	 * @return
+	 */
+	private static int findMaxChain(String[] words, String word, int lenCounter) {
+		if (!wordsContains(words, word)) {
+			return 0;
+		}
+		lenCounter++;
+		charCount = lenCounter;
+		for (int i = 0; i < word.length(); i++) {
+			StringBuilder sb = new StringBuilder(word);
+			sb.delete(i, i + 1);
+			findMaxChain(words, sb.toString(), lenCounter);
+		}
+		return charCount;
+	}
+
+	/**
+	 * @param string
+	 * @return
+	 */
+	private static boolean wordsContains(String[] words, String string) {
+		for (String word : words) {
+			if (word.equals(string)) {
+				return true;
+			}
+		}
+		return false;
+	}
+
+}