coded + unit tested + code refactoring

Ram swaroop · Ram swaroop · commit 66574c631b10 · 2015-10-22T13:33:48.000+05:30
diff --git a/src/com/hackerrank/algorithms/arraysandsorting/InsertionSort1.java b/src/com/hackerrank/algorithms/arraysandsorting/InsertionSort1.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.arraysandsorting;
+package com.hackerrank.algorithms.arraysandsorting;
 
 import java.util.Scanner;
 
diff --git a/src/com/hackerrank/algorithms/arraysandsorting/InsertionSort2.java b/src/com/hackerrank/algorithms/arraysandsorting/InsertionSort2.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.arraysandsorting;
+package com.hackerrank.algorithms.arraysandsorting;
 
 import java.util.Scanner;
 
diff --git a/src/com/hackerrank/algorithms/arraysandsorting/IntroTutorial.java b/src/com/hackerrank/algorithms/arraysandsorting/IntroTutorial.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.arraysandsorting;
+package com.hackerrank.algorithms.arraysandsorting;
 
 import java.util.Arrays;
 import java.util.Scanner;
diff --git a/src/com/hackerrank/algorithms/arraysandsorting/LoopInvariant.java b/src/com/hackerrank/algorithms/arraysandsorting/LoopInvariant.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.arraysandsorting;
+package com.hackerrank.algorithms.arraysandsorting;
 
 import java.util.Scanner;
 
diff --git a/src/com/hackerrank/algorithms/arraysandsorting/QuickSort1.java b/src/com/hackerrank/algorithms/arraysandsorting/QuickSort1.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.arraysandsorting;
+package com.hackerrank.algorithms.arraysandsorting;
 
 import java.util.Scanner;
 
diff --git a/src/com/hackerrank/algorithms/arraysandsorting/QuickSort2.java b/src/com/hackerrank/algorithms/arraysandsorting/QuickSort2.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.arraysandsorting;
+package com.hackerrank.algorithms.arraysandsorting;
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/com/hackerrank/algorithms/arraysandsorting/RunningTime.java b/src/com/hackerrank/algorithms/arraysandsorting/RunningTime.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.arraysandsorting;
+package com.hackerrank.algorithms.arraysandsorting;
 
 import java.util.Scanner;
 
diff --git a/src/com/hackerrank/algorithms/strings/AlternatingCharacters.java b/src/com/hackerrank/algorithms/strings/AlternatingCharacters.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.strings;
+package com.hackerrank.algorithms.strings;
 
 import java.util.Scanner;
 
diff --git a/src/com/hackerrank/algorithms/strings/PalindromeIndex.java b/src/com/hackerrank/algorithms/strings/PalindromeIndex.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.strings;
+package com.hackerrank.algorithms.strings;
 
 import java.util.Scanner;
 
diff --git a/src/com/hackerrank/algorithms/strings/Pangram.java b/src/com/hackerrank/algorithms/strings/Pangram.java
@@ -1,4 +1,4 @@
-package me.ramswaroop.algorithms.strings;
+package com.hackerrank.algorithms.strings;
 
 import java.util.Scanner;
 
diff --git a/src/com/hackerrank/algorithms/strings/TwoStrings.java b/src/com/hackerrank/algorithms/strings/TwoStrings.java
@@ -0,0 +1,40 @@
+package com.hackerrank.algorithms.strings;
+
+import java.util.Scanner;
+
+/**
+ * Created by IntelliJ IDEA.
+ *
+ * @author: ramswaroop
+ * @date: 10/22/15
+ * @time: 10:08 AM
+ */
+public class TwoStrings {
+
+    public static String isSubstringInBoth(String[] a) {
+        char[] alphabets = new char[]{'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p',
+                'q', 'r', 's', 't', 'u', 'v', 'x', 'y', 'z'};
+
+        for (int i = 0; i < alphabets.length; i++) {
+            if (a[0].indexOf(alphabets[i]) != -1 && a[1].indexOf(alphabets[i]) != -1) return "YES";
+        }
+
+        return "NO";
+    }
+
+    public static void main(String a[]) {
+        Scanner in = new Scanner(System.in);
+
+        int t = Integer.parseInt(in.nextLine());
+        String[][] input = new String[t][2];
+
+        for (int i = 0; i < t; i++) {
+            input[i][0] = in.nextLine();
+            input[i][1] = in.nextLine();
+        }
+
+        for (int i = 0; i < t; i++) {
+            System.out.println(isSubstringInBoth(input[i]));
+        }
+    }
+}
diff --git a/src/me/ramswaroop/backtracking/RatInAMaze.java b/src/me/ramswaroop/backtracking/RatInAMaze.java
@@ -9,6 +9,12 @@
  */
 public class RatInAMaze {
 
+    /**
+     * @param i
+     * @param j
+     * @param maze
+     * @return
+     */
     public static boolean isValidMove(int i, int j, int[][] maze) {
         if (i >= 0 && i < maze.length && j >= 0 && j < maze[0].length && maze[i][j] == 1) {
             return true;
@@ -17,6 +23,15 @@ public static boolean isValidMove(int i, int j, int[][] maze) {
         }
     }
 
+    /**
+     * @param i
+     * @param j
+     * @param xMoves
+     * @param yMoves
+     * @param maze
+     * @param path
+     * @return
+     */
     public static boolean isValidPath(int i, int j, int[] xMoves, int[] yMoves, int[][] maze, int[][] path) {
 
         if (i == maze.length - 1 && j == maze[0].length - 1) return true;
@@ -38,13 +53,18 @@ public static boolean isValidPath(int i, int j, int[] xMoves, int[] yMoves, int[
         return false;
     }
 
+    /**
+     * @param i    is the start row
+     * @param j    is the start column
+     * @param maze is the maze in which a path has to be found (1 denotes rat can traverse and 0 denotes it cannot)
+     */
     public static void printMazePath(int i, int j, int[][] maze) {
 
         int[] xMoves = {0, 1};
         int[] yMoves = {1, 0};
-        
+
         int[][] path = new int[maze.length][maze[0].length];
-        
+
         System.out.println("Maze");
         System.out.println("---------------");
         print2DMatrix(maze);
diff --git a/src/me/ramswaroop/strings/SubStringCheck.java b/src/me/ramswaroop/strings/SubStringCheck.java
@@ -8,7 +8,7 @@
  * @time: 1:15 PM
  * @see: me.ramswaroop.strings.StringRotation for a similar problem.
  */
-public class SubString {
+public class SubStringCheck {
 
     /**
      * Naive approach to determine whether string {@param s2} is a
diff --git a/src/me/ramswaroop/strings/SubStrings.java b/src/me/ramswaroop/strings/SubStrings.java
@@ -0,0 +1,49 @@
+package me.ramswaroop.strings;
+
+/**
+ * Created by IntelliJ IDEA.
+ *
+ * @author: ramswaroop
+ * @date: 10/22/15
+ * @time: 11:16 AM
+ */
+public class SubStrings {
+
+    /**
+     * Prints all sub-strings of string {@param s} iteratively.
+     *
+     * @param s
+     */
+    public static void printAllSubStrings(String s) {
+        for (int i = 0; i < s.length(); i++) {
+            for (int j = i; j < s.length(); j++) {
+                System.out.println(s.substring(i, j + 1));
+            }
+        }
+    }
+
+    /**
+     * Prints all sub-strings of string {@param s} recursively.
+     *
+     * @param s
+     */
+    public static void printAllSubStringsRecursive(String s) {
+        if (s.length() == 0) return;
+
+        for (int i = 1; i <= s.length(); i++) {
+            System.out.println(s.substring(0, i));
+        }
+        printAllSubStrings(s.substring(1));
+    }
+
+    public static void main(String a[]) {
+        System.out.println("----Iterative----");
+        printAllSubStrings("ram");
+        System.out.println("--------");
+        printAllSubStrings("");
+        System.out.println("----Recursive----");
+        printAllSubStringsRecursive("ram");
+        System.out.println("--------");
+        printAllSubStringsRecursive("");
+    }
+}

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package me.ramswaroop.algorithms.arraysandsorting;`
	`1`	`+package com.hackerrank.algorithms.arraysandsorting;`
`2`	`2`
`3`	`3`	`import java.util.Scanner;`
`4`	`4`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package me.ramswaroop.algorithms.strings;`
	`1`	`+package com.hackerrank.algorithms.strings;`
`2`	`2`
`3`	`3`	`import java.util.Scanner;`
`4`	`4`