Develop

algorithm-exercises-java/build.gradle

@@ -63,7 +63,7 @@ configurations.checkstyle {
 
 def jacocoExclusions = [
         '**/*App.class',
-        '**/CustomLogger.class'
+        '**/util/*'
 ];
 
 test {

algorithm-exercises-java/src/main/java/ae/Problem0000.java

@@ -4,6 +4,8 @@
 
 package ae;
 
+import util.Log;
+
 /**
  * {TITLE}.
  *
@@ -13,16 +15,14 @@ public class Problem0000 {
 
   private Problem0000() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
-
   /**
    * Problem template method.
    */
   public static Integer problem0000() {
     Integer result = null;
 
     String log = String.format("Problem 00XX solved: %d", result);
-    logger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotation.java

@@ -11,10 +11,8 @@
  */
 public class ArraysLeftRotation {
 
-  private ArraysLeftRotation() {
-  }
+  private ArraysLeftRotation() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
   static final int FIRST_POSITION = 0;
 
   /**

algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForce.java

@@ -12,10 +12,7 @@
  */
 public class CrushBruteForce {
 
-  private CrushBruteForce() {
-  }
-
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
+  private CrushBruteForce() {}
 
   private static final int INITIALIZER = 0;
 

algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushOptimized.java

@@ -12,10 +12,7 @@
  */
 public class CrushOptimized {
 
-  private CrushOptimized() {
-  }
-
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
+  private CrushOptimized() {}
 
   /**
    * arrayManipulation.

algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler001.java

@@ -1,5 +1,7 @@
 package ae.hackerrank.projecteuler;
 
+import util.Log;
+
 /**
  * Multiples of 3 and 5.
  *
@@ -9,8 +11,6 @@ public class Euler001 {
 
   private Euler001() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
-
   /**
    * Greatest common divisor.
    */
@@ -45,7 +45,7 @@ public static Long euler001(Integer a, Integer b, Integer n) {
       - sumOfArithmeticProgression((long) n, lcm);
 
     String log = String.format("Problem 001 solved: %d", result);
-    logger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler002.java

@@ -1,5 +1,7 @@
 package ae.hackerrank.projecteuler;
 
+import util.Log;
+
 /**
  * Even Fibonacci numbers.
  *
@@ -9,8 +11,6 @@ public class Euler002 {
 
   private Euler002() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
-
   private static Long fibbo(Integer n) {
     Long total = 0L;
     Long fibo;
@@ -37,7 +37,7 @@ public static Long euler002(Integer n) {
     Long result = fibbo(n);
 
     String log = String.format("Problem 002 solved: %d", result);
-    logger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/BirthdayCakeCandles.java

@@ -9,10 +9,7 @@
  */
 public class BirthdayCakeCandles {
 
-  private BirthdayCakeCandles() {
-  }
-
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
+  private BirthdayCakeCandles() {}
 
   /**
    * birthdayCakeCandles.

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/CompareTriplets.java

@@ -12,8 +12,6 @@ public class CompareTriplets {
 
   private CompareTriplets() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
-
   /**
    * compareTriplets.
    */

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/DiagonalDifference.java

@@ -11,8 +11,6 @@ public class DiagonalDifference {
 
   private DiagonalDifference() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
-
   /**
    * diagonalDifference.
    */

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/MiniMaxSum.java

@@ -11,8 +11,6 @@ public class MiniMaxSum {
 
   private MiniMaxSum() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
-
   /**
    * miniMaxSum.
    *

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/PlusMinus.java

@@ -11,10 +11,7 @@
  */
 public class PlusMinus {
 
-  private PlusMinus() {
-  }
-
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
+  private PlusMinus() {}
 
   /**
    * plusMinus.

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SimpleArraySum.java

@@ -1,6 +1,7 @@
 package ae.hackerrank.warmup;
 
 import java.util.List;
+import util.Log;
 
 /**
  * Simple Array Sum.
@@ -11,8 +12,6 @@ public class SimpleArraySum {
 
   private SimpleArraySum() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
-
   /**
    * simpleArraySum.
    */
@@ -24,7 +23,7 @@ public static int simpleArraySum(List<Integer> ar) {
     }
 
     String log = String.format("simpleArraySum solved: %d", total);
-    logger.info(log);
+    Log.info(log);
 
     return total;
   }

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SolveMeFirst.java

@@ -9,8 +9,6 @@ public class SolveMeFirst {
 
   private SolveMeFirst() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
-
   /**
    * solveMeFirst.
    */

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/Staircase.java

@@ -10,10 +10,7 @@
  */
 public class Staircase {
 
-  private Staircase() {
-  }
-
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
+  private Staircase() {}
 
   /**
    * staircase.

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/TimeConversion.java

@@ -8,10 +8,7 @@
  */
 public class TimeConversion {
 
-  private TimeConversion() {
-  }
-
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
+  private TimeConversion() {}
 
   /**
    * timeConversion.

algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/VeryBigSum.java

@@ -9,10 +9,7 @@
  */
 public class VeryBigSum {
 
-  private VeryBigSum() {
-  }
-
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
+  private VeryBigSum() {}
 
   /**
    * aVeryBigSum.

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0001.java

@@ -1,6 +1,6 @@
 package ae.projecteuler;
 
-import java.util.logging.Logger;
+import util.Log;
 
 /**
  * Multiples of 3 and 5.
@@ -11,8 +11,6 @@ public class Problem0001 {
 
   private Problem0001() {}
 
-  static Logger logger = util.CustomLogger.getLogger();
-
   /**
    * Problem0001.
    */
@@ -23,14 +21,14 @@ public static Integer problem0001(Integer top) {
     for (i = 0; i < top; i++) {
       if (i % 3 == 0 || i % 5 == 0) {
         String log = String.format("Line result: %d", i);
-        logger.fine(log);
+        Log.debug(log);
 
         result += i;
       }
     }
 
     String log = String.format("Problem 0001 solved: %d", result);
-    logger.info(log);
+    Log.info(log);
 
     return result;
   }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0002.java

@@ -1,6 +1,6 @@
 package ae.projecteuler;
 
-import java.util.logging.Logger;
+import util.Log;
 
 /**
  * Even Fibonacci numbers.
@@ -11,8 +11,6 @@ public class Problem0002 {
 
   private Problem0002() {}
 
-  static Logger logger = util.CustomLogger.getLogger();
-
   /**
    * Problem template method.
    */
@@ -28,7 +26,7 @@ public static Integer problem0002(int top) {
       fibo = last2 + last1;
 
       String log = String.format("Fibonacci(%d) = %d", i, fibo);
-      logger.fine(log);
+      Log.debug(log);
 
       if (fibo % 2 == 0) {
         evenSum += fibo;
@@ -41,7 +39,7 @@ public static Integer problem0002(int top) {
     } while (fibo < top);
 
     String log = String.format("Problem 0002 result: %d", evenSum);
-    logger.info(log);
+    Log.info(log);
 
     return evenSum;
   }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0003.java

@@ -3,6 +3,7 @@
 import ae.projecteuler.helper.Divisors;
 import ae.projecteuler.helper.NaturalNumber;
 import java.util.Arrays;
+import util.Log;
 
 
 /**
@@ -14,7 +15,6 @@ public class Problem0003 {
 
   private Problem0003() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
 
   /**
    * Problem 0003.
@@ -28,7 +28,7 @@ public static Long problem0003(Long top) {
 
     String log;
     log = String.format("Divisors of %d: %s", top, Arrays.toString(divs));
-    logger.info(log);
+    Log.info(log);
 
     Long maxPrimeFactor = null;
     Integer i = middle;
@@ -38,13 +38,13 @@ public static Long problem0003(Long top) {
       boolean prime = NaturalNumber.isPrime(divs[i]);
 
       log = String.format("%d is Prime?: %b", i, prime);
-      logger.fine(log);
+      Log.debug(log);
 
       if (prime) {
         maxPrimeFactor = divs[i];
 
         log = String.format("Problem 0003 solved: %d", maxPrimeFactor);
-        logger.info(log);
+        Log.info(log);
 
         return maxPrimeFactor;
       }

algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0004.java

@@ -10,6 +10,7 @@
 package ae.projecteuler;
 
 import ae.projecteuler.helper.Palindrome;
+import util.Log;
 
 /**
  * Largest palindrome product.
@@ -20,7 +21,6 @@ public class Problem0004 {
 
   private Problem0004() {}
 
-  static java.util.logging.Logger logger = util.CustomLogger.getLogger();
 
   /**
    * Problem template method.
@@ -42,7 +42,7 @@ public static Integer problem0004(int bottom, int top) {
 
         if (Palindrome.isPalindrome(Long.valueOf((long) j * (long) i))) {
           String log = String.format("FOUND: %d x %d = %d is Palindrome", i, j, i * j);
-          logger.fine(log);
+          Log.debug(log);
 
           if (foundPalindrome == null || i * j > foundPalindrome) {
             foundi = i;
@@ -64,7 +64,7 @@ public static Integer problem0004(int bottom, int top) {
         foundPalindrome,
         cycles);
 
-    logger.info(log);
+    Log.info(log);
 
     return foundPalindrome;
   }