Some refactorings

Author: rampatra

src/main/java/com/hackerrank/algorithms/strings/MakingAnagrams.java

@@ -18,7 +18,7 @@ public class MakingAnagrams {
      * @return
      */
     public static int makeAnagrams(String a, String b) {
-        
+
         int i = 0, j = 0, c = 0;
         char[] s1 = a.toCharArray();
         char[] s2 = b.toCharArray();

src/main/java/com/hackerrank/interviewpreparation/arrays/DS2DArrayProblem.java

@@ -16,10 +16,10 @@ public class DS2DArrayProblem {
     private static int hourglassSum(int[][] arr) {
         int maxSum = Integer.MIN_VALUE;
         int hourglassSum;
-        for (int i=0;i<arr.length-2;i++) {
-            for(int j=0;j<arr[0].length-2;j++) {
-                hourglassSum = arr[i][j] + arr[i][j+1] + arr[i][j+2] + arr[i+1][j+1] +
-                        arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2];
+        for (int i = 0; i < arr.length - 2; i++) {
+            for (int j = 0; j < arr[0].length - 2; j++) {
+                hourglassSum = arr[i][j] + arr[i][j + 1] + arr[i][j + 2] + arr[i + 1][j + 1] +
+                        arr[i + 2][j] + arr[i + 2][j + 1] + arr[i + 2][j + 2];
                 if (hourglassSum > maxSum) {
                     maxSum = hourglassSum;
                 }

src/main/java/com/hackerrank/projecteuler/MultiplesOf3and5.java

@@ -13,8 +13,8 @@ public class MultiplesOf3and5 {
 
     public static void main(String a[]) {
         Scanner in = new Scanner(System.in);
-        
+
         int t = Integer.parseInt(in.nextLine());
-        
+
     }
 }

src/main/java/com/rampatra/arrays/CelebrityProblem.java

@@ -13,7 +13,7 @@
  * In a party of N people, only one person is known to everyone. Such a person may be present in the party, if yes,
  * (s)he doesn’t know anyone in the party. We can only ask questions like “does A know B? “. Find the stranger
  * (celebrity) in minimum number of questions.
- * 
+ * <p>
  * TODO: Not tested.
  */
 public class CelebrityProblem {
@@ -44,7 +44,7 @@ public static boolean haveAcquaintance(int[][] peoples, int a, int b) {
      * - Push the remained person onto stack.
      * - Repeat step 2 and 3 until only one person remains in the stack.
      * - Check the remained person in stack does not have acquaintance with anyone else.
-     * 
+     *
      * @param peoples
      * @return
      */

src/main/java/com/rampatra/arrays/EqualProbabilityRandomNoGenerator.java

@@ -6,7 +6,7 @@
 /**
  * Given a random number generator f(n) which generates a random number
  * from {@code 0} (inclusive) to {@code n} (exclusive), design a method
- * which uses f(n) to generate non repeating random numbers from 
+ * which uses f(n) to generate non repeating random numbers from
  * {@code 0} (inclusive) to {@code n} (exclusive)?
  *
  * @author: ramswaroop
@@ -19,9 +19,9 @@ public class EqualProbabilityRandomNoGenerator {
     static int size;
 
     /**
-     * The algorithm is to create a bucket of numbers and then to keep on 
+     * The algorithm is to create a bucket of numbers and then to keep on
      * removing the elements from the bucket which are returned.
-     * 
+     *
      * @return
      */
     public static int getRandom() {
@@ -37,12 +37,12 @@ public static int f(int n) {
 
     public static void main(String a[]) {
         Scanner in = new Scanner(System.in);
-        
+
         System.out.println("How many random numbers you would like to generate?");
         size = in.nextInt();
-        
+
         bucket = new int[size];
-        
+
         for (int i = 0; i < bucket.length; i++) {
             bucket[i] = i;
         }

src/main/java/com/rampatra/arrays/IntersectionAndUnionOf2SortedArrays.java

@@ -12,9 +12,9 @@
 public class IntersectionAndUnionOf2SortedArrays {
 
     /**
-     * Returns a 2-D array consisting of intersection and union of 
+     * Returns a 2-D array consisting of intersection and union of
      * two sorted arrays {@param a} and {@param b} respectively.
-     * 
+     *
      * @param a
      * @param b
      * @return
@@ -24,7 +24,7 @@ public static int[][] getIntersectionAndUnionOf2SortedArrays(int[] a, int[] b) {
         int[] intersection = new int[length], union = new int[length];
 
         for (int i = 0, j = 0; i < a.length || j < b.length; ) {
-            
+
             // if either of the arrays runs out first
             if (i == a.length) {
                 union[y++] = b[j++];

src/main/java/com/rampatra/arrays/InversionsInArray.java

@@ -40,7 +40,7 @@ public static int getInversionCountNaiveApproach(int[] a) {
 
     /**
      * Optimized approach.
-     *
+     * <p>
      * Explanation: In merge() if a[i] > b[j] then all elements in array a starting
      * from i are greater than b[j] which equals to the number of inversions for
      * the two sub-arrays.

src/main/java/com/rampatra/arrays/KLargestElements.java

@@ -15,17 +15,17 @@ public class KLargestElements {
 
     /**
      * Finds {@param k} largest elements in array {@param a}.
-     *
+     * <p>
      * Algorithm:
      * 1) Build a Min Heap MH of the first k elements (arr[0] to arr[k-1]) of the given array. This takes O(k) time.
-     *
+     * <p>
      * 2) For each element, after the kth element (arr[k] to arr[n-1]), compare it with root of MH.
      * ……a) If the element is greater than the root then make it root and call buildHeap for MH
      * ……b) Else ignore it.
      * This step takes (n-k) * O(k) time.
-     *
+     * <p>
      * 3) Finally, MH has k largest elements and root of the MH is the kth largest element.
-     *
+     * <p>
      * Therefore, the total time complexity of the above algorithm is: O(k) + (n-k) * O(k).
      *
      * @param a

src/main/java/com/rampatra/arrays/KthLargestElement.java

@@ -44,7 +44,7 @@ public static int getKthLargestElement(int[] a, int k) {
         maxHeap.buildMaxHeap();
         while (true) {
             if (k == 1) break;
-            
+
             maxHeap.extractMax();
             k--;
         }

src/main/java/com/rampatra/arrays/LargestProductContiguousSubArray.java

@@ -10,7 +10,6 @@
 public class LargestProductContiguousSubArray {
 
     /**
-     *
      * @param a
      * @return
      */