Changed c style array in some places to java style

Author: rampatra

Diff for: README.md

@@ -15,7 +15,7 @@ static int search(int searchVal, int[] arr) {
         return Arrays.binarySearch(arr, searchVal);
     }
 
-    public static void main(String[] a) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         int searchVal = in.nextInt();

Diff for: src/main/java/com/hackerrank/algorithms/arraysandsorting/IntroTutorial.java

@@ -47,7 +47,7 @@ public static int makeAnagrams(String a, String b) {
         return c;
     }
 
-    public static void main(String[] a) {
+    public static void main(String[] args) {
         System.out.println(makeAnagrams("abc", "cde"));
     }
 }

Diff for: src/main/java/com/hackerrank/algorithms/strings/MakingAnagrams.java

@@ -37,7 +37,7 @@ static boolean isPalindrome(String s) {
         return true;
     }
 
-    public static void main(String[] a) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         int t = in.nextInt();

Diff for: src/main/java/com/hackerrank/algorithms/strings/PalindromeIndex.java

@@ -22,7 +22,7 @@ public static String isSubstringInBoth(String[] a) {
         return "NO";
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         int t = Integer.parseInt(in.nextLine());

Diff for: src/main/java/com/hackerrank/algorithms/strings/TwoStrings.java

@@ -20,7 +20,7 @@ static int calcPalindromeSteps(String s) {
         return steps;
     }
 
-    public static void main(String[] a) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         int t = in.nextInt();

Diff for: src/main/java/com/hackerrank/algorithms/warmup/LoveLetterMystery.java

@@ -23,7 +23,7 @@ static int calcHeight(int growthCycles) {
         return h;
     }
 
-    public static void main(String[] a) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         int t = in.nextInt();

Diff for: src/main/java/com/hackerrank/algorithms/warmup/UtopianTree.java

@@ -37,7 +37,7 @@ public static String computeWinner(BigInteger n) {
         return (louiseTurn) ? "Richard" : "Louise";
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         int t = Integer.parseInt(in.nextLine());

Diff for: src/main/java/com/hackerrank/bitmanipulation/CounterGame.java

@@ -19,7 +19,7 @@ public static long countSetBitsInRange(int start, int end) {
         return count;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         int t = Integer.parseInt(in.nextLine());

Diff for: src/main/java/com/hackerrank/bitmanipulation/TwosCompliment.java

@@ -13,7 +13,7 @@ public void JavaInheritance() {
 
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
 
     }
 }

Diff for: src/main/java/com/hackerrank/java/oops/JavaInheritance.java

@@ -11,7 +11,7 @@
  */
 public class MultiplesOf3and5 {
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         int t = Integer.parseInt(in.nextLine());

Diff for: src/main/java/com/hackerrank/projecteuler/MultiplesOf3and5.java

@@ -39,7 +39,7 @@ public int compare(Integer o1, Integer o2) {
         return a;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(arrangeArrayOfNosToFormBiggestNo(new Integer[]{45, 567, 12, 1})));
         System.out.println(Arrays.toString(arrangeArrayOfNosToFormBiggestNo(new Integer[]{54, 546, 548, 60})));
         System.out.println(Arrays.toString(arrangeArrayOfNosToFormBiggestNo(new Integer[]{1, 34, 3, 98, 9, 76, 45, 4})));

Diff for: src/main/java/com/rampatra/arrays/ArrangeNosToFormBiggestNo.java

@@ -67,7 +67,7 @@ private static void print2DMatrix(int[][] a) {
         }
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         int[][] ar = new int[][]{{1, 0, 0, 1}, {0, 0, 1, 0}, {0, 0, 0, 0}};
         print2DMatrix(ar);
         modifyBooleanMatrix(ar);

Diff for: src/main/java/com/rampatra/arrays/BooleanMatrix.java

@@ -78,7 +78,7 @@ public static int findCelebrity(int[][] peoples) {
         return firstPerson;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(findCelebrity(new int[][]{{0, 0, 1, 0}, {0, 0, 1, 0}, {0, 0, 0, 0}, {0, 0, 1, 0}}));
         System.out.println(findCelebrity(new int[][]{{0, 0, 0, 1}, {0, 0, 0, 1}, {0, 0, 0, 1}, {0, 0, 0, 1}}));
     }

Diff for: src/main/java/com/rampatra/arrays/CelebrityProblem.java

@@ -99,7 +99,7 @@ public static boolean areConsecutiveElementsInO1Space(int[] a) {
         return true;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(areConsecutiveElements(new int[]{5, 4, 3, 2, 1}));
         System.out.println(areConsecutiveElements(new int[]{67, 68, 69, 72, 70, 71}));
         System.out.println(areConsecutiveElements(new int[]{67, 68, 69, 72, 70, 71, 70}));

Diff for: src/main/java/com/rampatra/arrays/ConsecutiveElements.java

@@ -24,7 +24,7 @@ public static int countDivisorsInRange(int begin, int end, int n) {
         return b - a;     // return integers in range
     }
 
-    public static void main(String[] a) {
+    public static void main(String[] args) {
         countDivisorsInRange(0, 2000000000, 5);
     }
 }

Diff for: src/main/java/com/rampatra/arrays/CountDivisors.java

@@ -16,7 +16,7 @@ public static int[] getSmallerElementsCountOnRHSNaive(int[] a) {
         return null;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(getSmallerElementsCountOnRHSNaive(new int[]{12, 1, 2, 3, 0, 11, 4})));
         System.out.println(Arrays.toString(getSmallerElementsCountOnRHSNaive(new int[]{5, 4, 3, 2, 1})));
         System.out.println(Arrays.toString(getSmallerElementsCountOnRHSNaive(new int[]{1, 2, 3, 4, 5})));

Diff for: src/main/java/com/rampatra/arrays/CountSmallerElementsOnRHS.java

@@ -43,7 +43,7 @@ public static int[] findDuplicatesInArray(int[] a) {
         return duplicates;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(findDuplicatesInArray(new int[]{1, 1, 2, 3, 1, 3, 6, 6})));
         // doesn't work if 0 is present in array (as -0 makes no sense but we can modify the algorithm to handle 0)
         System.out.println(Arrays.toString(findDuplicatesInArray(new int[]{1, 0, 1, 2, 3, 1, 3, 6, 6})));

Diff for: src/main/java/com/rampatra/arrays/DuplicatesInArray.java

@@ -41,7 +41,7 @@ public static int[] findDuplicatesInArrayWithinKDistance(int[] a, int k) {
         return Arrays.copyOf(duplicates, index);
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(findDuplicatesInArrayWithinKDistance(new int[]{1, 2, 8, 1, 3, 4, 5, 6, 6, 7}, 3)));
     }
 }

Diff for: src/main/java/com/rampatra/arrays/DuplicatesInArrayWithinKDistance.java

@@ -35,7 +35,7 @@ public static int f(int n) {
         return new Random().nextInt(n);
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
 
         System.out.println("How many random numbers you would like to generate?");

Diff for: src/main/java/com/rampatra/arrays/EqualProbabilityRandomNoGenerator.java

@@ -44,7 +44,7 @@ public static int getEquilibriumIndex(int[] a) {
         return -1;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(getEquilibriumIndex(new int[]{-7, 1, 5, 2, -4, 3, 0}));
         System.out.println(getEquilibriumIndex(new int[]{-7, 1, 5, 0, 0, 0, 0, 1, 2, -4, 1, 3, 0}));
         System.out.println(getEquilibriumIndex(new int[]{4, 5, 2, 1, 6, 7, 8, 0, 1}));

Diff for: src/main/java/com/rampatra/arrays/EquilibriumIndex.java

@@ -33,7 +33,7 @@ public static int findFixedPoint(int[] a) {
         return -1;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(findFixedPoint(new int[]{-10, -5, 0, 3, 7}));
         System.out.println(findFixedPoint(new int[]{0, 2, 5, 8, 17}));
         System.out.println(findFixedPoint(new int[]{-10, -5, 3, 4, 7, 9}));

Diff for: src/main/java/com/rampatra/arrays/FixedPoint.java

@@ -50,7 +50,7 @@ public static int[][] getIntersectionAndUnionOf2SortedArrays(int[] a, int[] b) {
         return new int[][]{intersection, union};
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         int[] a1 = new int[]{2, 3, 4, 5, 6, 7, 8};
         int[] a2 = new int[]{6, 7, 8, 10, 12, 14, 16};
         int[][] result = getIntersectionAndUnionOf2SortedArrays(a1, a2);

Diff for: src/main/java/com/rampatra/arrays/IntersectionAndUnionOf2SortedArrays.java

@@ -95,7 +95,7 @@ public static int[] merge(int[] a, int[] b) {
         return sortedArray;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(getInversionCountNaiveApproach(new int[]{2, 4, 1, 3, 5}));
         System.out.println(getInversionCount(new int[]{2, 4, 1, 3, 5}));
     }

Diff for: src/main/java/com/rampatra/arrays/InversionsInArray.java

@@ -49,7 +49,7 @@ public static int[] getKLargestElements(int[] a, int k) {
         return minHeap.getHeap();
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(getKLargestElements(new int[]{2, 3, 4, 1, 5, 7, 9}, 3)));
     }
 }

Diff for: src/main/java/com/rampatra/arrays/KLargestElements.java

@@ -52,7 +52,7 @@ public static int getKthLargestElement(int[] a, int k) {
         return maxHeap.findMax();
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         int[] ar = new int[]{2, 4, 5, 7, 1, 8, 9};
         System.out.println(Arrays.toString(ar));
         System.out.println(getKthLargestElementNaive(ar, 3));

Diff for: src/main/java/com/rampatra/arrays/KthLargestElement.java

@@ -17,7 +17,7 @@ public static int getLargestProductContiguousSubArray(int[] a) {
         return 0;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(getLargestProductContiguousSubArray(new int[]{-2, 1, -3, 4, 5, -1, 4}));
         System.out.println(getLargestProductContiguousSubArray(new int[]{6, -3, -10, 0, 2}));
     }

Diff for: src/main/java/com/rampatra/arrays/LargestProductContiguousSubArray.java

@@ -47,7 +47,7 @@ public static int getLargestSumOfContiguousSubArrayWhenAllNosNegative(int[] a) {
         return maxSum;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(getLargestSumOfContiguousSubArray(new int[]{-2, 1, -3, 4, 5, -1, 4}));
         System.out.println(getLargestSumOfContiguousSubArray(new int[]{2, -1, -3, 4, -5, 1, 4}));
         // kadane's algorithm doesn't work if all no.s are -ve

Diff for: src/main/java/com/rampatra/arrays/LargestSumContiguousSubArray.java

@@ -37,7 +37,7 @@ public static int[] getAllLeaders(int[] a) {
         return Arrays.copyOfRange(leaders, 0, j + 1);
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(getAllLeaders(new int[]{16, 17, 4, 3, 5, 2})));
         System.out.println(Arrays.toString(getAllLeaders(new int[]{16, 1, 4, 3, 5, 12})));
         System.out.println(Arrays.toString(getAllLeaders(new int[]{16, 15, 14, 13, 12, 10})));

Diff for: src/main/java/com/rampatra/arrays/LeadersInArray.java

@@ -54,7 +54,7 @@ public static int getLongestBitonicSubArrayLength(int[] a) {
         return bitonicLength;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(getLongestBitonicSubArrayLength(new int[]{1, 2, 5, 4, 3}));
         System.out.println(getLongestBitonicSubArrayLength(new int[]{12, 4, 78, 90, 45, 23}));
         System.out.println(getLongestBitonicSubArrayLength(new int[]{10, 20, 30, 40}));

Diff for: src/main/java/com/rampatra/arrays/LongestBitonicSubArray.java

@@ -62,7 +62,7 @@ public static void majorityElement(int a[]) {
         }
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         majorityElement(new int[]{1, 6, 2, 2, 2, 1, 2, 2, 7, 2});
     }
 }

Diff for: src/main/java/com/rampatra/arrays/MajorityElement.java

@@ -64,7 +64,7 @@ public static int getFirstIndexOf(int[] a, int n, int low, int high) {
         return -1;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(isMajorityElement(new int[]{2, 2}, 2));
         System.out.println(isMajorityElement(new int[]{1, 2}, 2));
         System.out.println(isMajorityElement(new int[]{1, 2, 2, 2, 2, 2, 3, 3}, 2));

Diff for: src/main/java/com/rampatra/arrays/MajorityElementInSortedArray.java

@@ -43,7 +43,7 @@ public static void printMatrixInSpiral(int[][] a) {
         }
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         printMatrixInSpiral(new int[][]{{1}, {2}});
         out.println();
         printMatrixInSpiral(new int[][]{{1, 2}, {3, 4}});

Diff for: src/main/java/com/rampatra/arrays/MatrixInSpiral.java

@@ -35,7 +35,7 @@ public static int getMaxDiffWithLargerElementAfterSmallerElement(int[] a) {
         return maxDiff;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(getMaxDiffWithLargerElementAfterSmallerElement(new int[]{2, 1, 4, 5, 10, 0}));
         System.out.println(getMaxDiffWithLargerElementAfterSmallerElement(new int[]{2, -6, 4, 5, 10, 1}));
         System.out.println(getMaxDiffWithLargerElementAfterSmallerElement(new int[]{-2, -6, -4, -5, -10, -1}));

Diff for: src/main/java/com/rampatra/arrays/MaxDiffWithLargerElementAfterSmallerElement.java

@@ -93,7 +93,7 @@ public static int[] maxInAllSubArraysOfSizeK(int[] a, int k) {
         return result;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(maxInAllSubArraysOfSizeKNaive(new int[]{1, 2, 3, 1, 4, 5, 2, 3, 6}, 3)));
         System.out.println(Arrays.toString(maxInAllSubArraysOfSizeKNaive(new int[]{8, 5, 10, 7, 9, 4, 15, 12, 90, 13}, 4)));
         System.out.println(Arrays.toString(maxInAllSubArraysOfSizeK(new int[]{1, 2, 3, 1, 4, 5, 2, 3, 6}, 3)));

Diff for: src/main/java/com/rampatra/arrays/MaxInAllSubArrays.java

@@ -49,7 +49,7 @@ public static int maxDiff(int[] a) {
         return maxDiff;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(maxDiff(new int[]{34, 8, 10, 3, 2, 80, 30, 33, 1}));
         System.out.println(maxDiff(new int[]{9, 2, 3, 4, 5, 6, 7, 8, 18, 0}));
         System.out.println(maxDiff(new int[]{1, 2, 3, 4, 5, 6}));

Diff for: src/main/java/com/rampatra/arrays/MaxIndexDiff.java

@@ -53,7 +53,7 @@ public static int[] getMaxMinWithMinComparisons(int[] a) {
         return new int[]{min, max};
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(getMaxMinWithMinComparisons(new int[]{2, 5, 1, 6, 7, 9, 0, 8, 10})));
     }
 }

Diff for: src/main/java/com/rampatra/arrays/MaxMinWithMinComparisons.java

@@ -64,7 +64,7 @@ public static void printMaximumSizeSquareSubMatrix(int[][] a) {
         }
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         int[][] ar = new int[][]{{0, 1, 1, 1},
                 {1, 1, 0, 1},
                 {1, 0, 0, 1},

Diff for: src/main/java/com/rampatra/arrays/MaximumSizeSquareSubMatrix.java

@@ -35,7 +35,7 @@ public static int maximumSumNonAdjacentSubSequence(int[] a) {
         return Math.max(incl, excl);
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(maximumSumNonAdjacentSubSequence(new int[]{3, 2, 7, 10}));
         System.out.println(maximumSumNonAdjacentSubSequence(new int[]{3, 2, 5, 10, 7}));
     }

Diff for: src/main/java/com/rampatra/arrays/MaximumSumNonAdjacentSubSequence.java

@@ -73,7 +73,7 @@ static int compare(int a, int b) {
         }
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         printMedianOfStream(new int[]{5, 15, 1, 3, 2, 8, 7, 9, 10, 6, 11, 4});
         printMedianOfStream(new int[]{5, 15, 1});
         printMedianOfStream(new int[]{5, 15, 10, 20});

Diff for: src/main/java/com/rampatra/arrays/MedianOfStream.java

@@ -94,7 +94,7 @@ public static int median(int[] a1, int[] a2) {
         }
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         // test cases
         System.out.println(median(new int[]{1, 2, 3, 6}, new int[]{4, 6, 8, 9}));
         System.out.println(median(new int[]{4, 6, 8, 9}, new int[]{1, 2, 3, 6}));

Diff for: src/main/java/com/rampatra/arrays/MedianOfTwoSortedArrays.java

@@ -57,7 +57,7 @@ public static void merge(int[] mPlusN, int[] n) {
         }
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         int[] mPlusN = {2, NA, 12, NA, NA, 14, NA};
         int[] n = {5, 7, 8, 10};
         merge(mPlusN, n);

Diff for: src/main/java/com/rampatra/arrays/MergeArrayOfNIntoArrayOfMPlusN.java

@@ -45,7 +45,7 @@ public static int getMinimumDistanceBetweenTwoNos(int[] a, int x, int y) {
         return minDiff;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(getMinimumDistanceBetweenTwoNos(new int[]{1, 2}, 1, 2));
         System.out.println(getMinimumDistanceBetweenTwoNos(new int[]{3, 4, 5}, 3, 5));
         System.out.println(getMinimumDistanceBetweenTwoNos(new int[]{3, 5, 4, 2, 6, 5, 6, 6, 5, 4, 8, 3}, 3, 6));

Diff for: src/main/java/com/rampatra/arrays/MinimumDistanceBetweenTwoNos.java

@@ -38,7 +38,7 @@ public static int[] findMissingAndRepeatingElements(int[] a) {
         return result;
     }
 
-    public static void main(String a[]) {
+    public static void main(String[] args) {
         System.out.println(Arrays.toString(findMissingAndRepeatingElements(new int[]{3, 1, 3})));
         System.out.println(Arrays.toString(findMissingAndRepeatingElements(new int[]{4, 3, 6, 2, 1, 1})));
         System.out.println(Arrays.toString(findMissingAndRepeatingElements(new int[]{4, 4, 6, 2, 5, 1})));