camel casing fix

Author: rampatra

src/com/hackerrank/algorithms/implementation/GridSearch.java

@@ -0,0 +1,53 @@
+package com.hackerrank.algorithms.implementation;
+
+import java.util.Scanner;
+
+/**
+ * Created by ramswaroop on 02/05/2016.
+ */
+public class GridSearch {
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        int t = in.nextInt();
+        for (int a0 = 0; a0 < t; a0++) {
+            int R = in.nextInt();
+            int C = in.nextInt();
+            String G[] = new String[R];
+            for (int G_i = 0; G_i < R; G_i++) {
+                G[G_i] = in.next();
+            }
+            int r = in.nextInt();
+            int c = in.nextInt();
+            String P[] = new String[r];
+            for (int P_i = 0; P_i < r; P_i++) {
+                P[P_i] = in.next();
+            }
+            int count = 0;
+            int start = 0;
+
+            loop1:
+            for (int G_i = 0; G_i < R; G_i++) {
+                if ((start = G[G_i].indexOf(P[0], start)) > -1) {
+                    count = 1;
+                    for (int P_i = 1; P_i < r && G_i + P_i < R; P_i++) {
+                        if (G[G_i + P_i].indexOf(P[P_i]) != start) {
+                            break;
+                        }
+                        count++;
+                    }
+                    if (count == r) {
+                        System.out.println("YES");
+                        break;
+                    } else {
+                        continue loop1;
+                    }
+                }
+            }
+            if (count != r) {
+                System.out.println("NO");
+            }
+        }
+    }
+}
+

src/me/ramswaroop/trees/ConstructTreeFromInorderAndPreorder.java

@@ -11,7 +11,7 @@
  * @date: 6/26/15
  * @time: 5:34 PM
  */
-public class ConstructTreeFromInOrderAndPreorder {
+public class ConstructTreeFromInOrderAndPreOrder {
 
     public <E extends Comparable<E>> void constructTreeWithInOrderAndPreOrder(List<BinaryNode<E>> inOrder,
                                                                               List<BinaryNode<E>> preOrder) {