diff --git a/Makefile b/Makefile index 896ea8cf..ad57e89b 100644 --- a/Makefile +++ b/Makefile @@ -85,8 +85,8 @@ lint: lint/markdown lint/yaml lint/json test/styling test/static format/json: prettier --write ./algorithm-exercises-java/**/*.json -format/sources: # TODO: Implement source code formatting - @echo "NOT IMPLEMENTED YET" +format/sources: + $(GRADLE) --console=verbose spotlessApply format: format/sources format/json diff --git a/algorithm-exercises-java/build.gradle b/algorithm-exercises-java/build.gradle index 8934b191..f65fc50d 100644 --- a/algorithm-exercises-java/build.gradle +++ b/algorithm-exercises-java/build.gradle @@ -10,11 +10,13 @@ plugins { // Apply the application plugin to add support for building a CLI application in Java. id 'application' id 'checkstyle' + id 'org.openrewrite.rewrite' version '7.6.2' id 'jacoco' id 'org.barfuin.gradle.jacocolog' version '4.0.1' id 'com.adarshr.test-logger' version '4.0.0' id "org.sonarqube" version "7.2.2.6593" id "com.github.ben-manes.versions" version "0.53.0" + id "com.diffplug.spotless" version "7.0.0" } repositories { @@ -35,6 +37,7 @@ dependencies { implementation 'com.fasterxml.jackson.core:jackson-annotations:2.21' implementation 'com.fasterxml.jackson.core:jackson-databind:2.21.0' + rewrite 'org.openrewrite.recipe:rewrite-static-analysis:latest.release' } application { @@ -55,6 +58,22 @@ checkstyle { showViolations = true } +spotless { + java { + target 'src/*/java/**/*.java' + googleJavaFormat('1.33.0') + removeUnusedImports() + trimTrailingWhitespace() + endWithNewline() + } +} + +// Reference: https://docs.openrewrite.org/running-recipes/popular-recipe-guides/automatically-fix-checkstyle-violations +rewrite { + activeRecipe 'org.openrewrite.staticanalysis.CodeCleanup' + checkstyleConfigFile = file("checkstyle.xml") +} + configurations.checkstyle { resolutionStrategy.capabilitiesResolution.withCapability("com.google.collections:google-collections") { select("com.google.guava:guava:33.5.0-jre") diff --git a/algorithm-exercises-java/gradle.properties b/algorithm-exercises-java/gradle.properties new file mode 100644 index 00000000..4257286d --- /dev/null +++ b/algorithm-exercises-java/gradle.properties @@ -0,0 +1,5 @@ +org.gradle.jvmargs=--add-exports jdk.compiler/com.sun.tools.javac.api=ALL-UNNAMED \ + --add-exports jdk.compiler/com.sun.tools.javac.file=ALL-UNNAMED \ + --add-exports jdk.compiler/com.sun.tools.javac.parser=ALL-UNNAMED \ + --add-exports jdk.compiler/com.sun.tools.javac.tree=ALL-UNNAMED \ + --add-exports jdk.compiler/com.sun.tools.javac.util=ALL-UNNAMED diff --git a/algorithm-exercises-java/src/main/java/ae/Problem0000.java b/algorithm-exercises-java/src/main/java/ae/Problem0000.java index 0a4142e7..58d0149c 100644 --- a/algorithm-exercises-java/src/main/java/ae/Problem0000.java +++ b/algorithm-exercises-java/src/main/java/ae/Problem0000.java @@ -15,9 +15,7 @@ public class Problem0000 { private Problem0000() {} - /** - * Problem template method. - */ + /** Problem template method. */ public static Integer problem0000() { Integer result = null; @@ -28,4 +26,4 @@ public static Integer problem0000() { } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotation.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotation.java index 3ec1eb81..13eac728 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotation.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotation.java @@ -3,11 +3,11 @@ import java.util.ArrayList; import java.util.List; - /** * Arrays Left Rotation. * - * @link Problem definition [[docs/hackerrank/interview_preparation_kit/arrays/ctci_array_left_rotation.md]] + * @link Problem definition + * [[docs/hackerrank/interview_preparation_kit/arrays/ctci_array_left_rotation.md]] */ public class ArraysLeftRotation { @@ -15,9 +15,7 @@ private ArraysLeftRotation() {} static final int FIRST_POSITION = 0; - /** - * rotLeftOne. - */ + /** rotLeftOne. */ public static List rotLeftOne(List a) { // Clone the list List output = new ArrayList<>(a); @@ -29,9 +27,7 @@ public static List rotLeftOne(List a) { return output; } - /** - * rotLeft. - */ + /** rotLeft. */ public static List rotLeft(List a, int d) { // Clone the list diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForce.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForce.java index 20599fa1..23bf13be 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForce.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForce.java @@ -3,12 +3,12 @@ import java.util.Arrays; import java.util.List; - /** * Crush (Brute Force). * * @link Problem definition [[docs/hackerrank/interview_preparation_kit/arrays/crush.md]] - * @link Solution notes [[docs/hackerrank/interview_preparation_kit/arrays/crush_optimized-solution-notes.md]] + * @link Solution notes + * [[docs/hackerrank/interview_preparation_kit/arrays/crush_optimized-solution-notes.md]] */ public class CrushBruteForce { @@ -16,12 +16,10 @@ private CrushBruteForce() {} private static final int INITIALIZER = 0; - /** - * arrayManipulation. - */ + /** arrayManipulation. */ public static long arrayManipulation(int n, List> queries) { // why adding 1? - // first slot to adjust 1-based index and + // first slot to adjust 1-based index and int[] result = new int[n + 1]; Arrays.fill(result, INITIALIZER); int maximum = INITIALIZER; diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushOptimized.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushOptimized.java index e50f1823..a819f3fd 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushOptimized.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/CrushOptimized.java @@ -3,24 +3,22 @@ import java.util.Arrays; import java.util.List; - /** * Crush (Optimized). * * @link Problem definition [[docs/hackerrank/interview_preparation_kit/arrays/crush.md]] - * @link Solution notes [[docs/hackerrank/interview_preparation_kit/arrays/crush_optimized-solution-notes.md]] + * @link Solution notes + * [[docs/hackerrank/interview_preparation_kit/arrays/crush_optimized-solution-notes.md]] */ public class CrushOptimized { private CrushOptimized() {} - /** - * arrayManipulation. - */ + /** arrayManipulation. */ public static long arrayManipulation(int n, List> queries) { // why adding 2? - // first slot to adjust 1-based index and - // last slot for storing accumSum result + // first slot to adjust 1-based index and + // last slot for storing accumSum result int[] result = new int[n + 2]; Arrays.fill(result, 0); int maximum = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/MinimumSwaps2.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/MinimumSwaps2.java index 8d67b921..44623d19 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/MinimumSwaps2.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/MinimumSwaps2.java @@ -4,7 +4,6 @@ import java.util.stream.Collectors; import java.util.stream.IntStream; - /** * Crush (Optimized). * @@ -14,14 +13,10 @@ public class MinimumSwaps2 { private MinimumSwaps2() {} - /** - * minimumSwaps. - */ + /** minimumSwaps. */ static int minimumSwaps(int[] arr) { - List indexedGroup = IntStream.of(arr) - .boxed() - .map(t -> t - 1) - .collect(Collectors.toList()); + List indexedGroup = + IntStream.of(arr).boxed().map(t -> t - 1).collect(Collectors.toList()); int swaps = 0; int index = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaos.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaos.java index 0dcbf994..e2a837f1 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaos.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaos.java @@ -2,7 +2,6 @@ import java.util.List; - /** * New Year Chaos. * @@ -15,10 +14,7 @@ private NewYearChaos() {} static final String TOO_CHAOTIC_ERROR = "Too chaotic"; static final int NEW_YEAR_CHAOS_TOLERANCE = 2; - - /** - * minimumBribesCalculate. - */ + /** minimumBribesCalculate. */ @SuppressWarnings("java:S6885") public static Integer minimumBribesCalculate(List q) { int bribes = 0; @@ -31,9 +27,8 @@ public static Integer minimumBribesCalculate(List q) { throw new IllegalStateException(TOO_CHAOTIC_ERROR); } - List fragment = q.subList( - Math.min(Math.max(value - NEW_YEAR_CHAOS_TOLERANCE, 0), i), i - ); + List fragment = + q.subList(Math.min(Math.max(value - NEW_YEAR_CHAOS_TOLERANCE, 0), i), i); for (Integer k : fragment) { if (k > value) { @@ -46,9 +41,7 @@ public static Integer minimumBribesCalculate(List q) { return bribes; } - /** - * minimumBribes. - */ + /** minimumBribes. */ public static String minimumBribesText(List q) { try { Integer bribes = minimumBribesCalculate(q); @@ -58,12 +51,9 @@ public static String minimumBribesText(List q) { } } - /** - * minimumBribesText. - */ + /** minimumBribesText. */ @SuppressWarnings("java:S106") public static void minimumBribes(List q) { System.out.println(minimumBribesText(q)); } - } diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/TwoDarray.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/TwoDarray.java index 22beca92..2d9b9751 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/TwoDarray.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/arrays/TwoDarray.java @@ -5,13 +5,12 @@ import java.util.stream.Collectors; /** - * 2D Array - DS. - * - * @link Problem definition [[docs/hackerrank/interview_preparation_kit/arrays/2d_array.md]] - */ - + * 2D Array - DS. + * + * @link Problem definition [[docs/hackerrank/interview_preparation_kit/arrays/2d_array.md]] + */ public class TwoDarray { - private TwoDarray() { } + private TwoDarray() {} private static List getHourGlass(List> arr, int positionX, int positionY) { List result = new ArrayList<>(); @@ -32,9 +31,7 @@ private static List getHourGlass(List> arr, int positionX return result; } - /** - * hourglassSum. - */ + /** hourglassSum. */ public static Integer hourglassSum(List> arr) { int matrixSize = 0; @@ -52,8 +49,8 @@ public static Integer hourglassSum(List> arr) { for (int i = matrixStartIndex; i <= matrixEndIndex; i++) { for (int j = matrixStartIndex; j <= matrixEndIndex; j++) { List currentHourGlass = getHourGlass(arr, i, j); - int hourGlassSum = currentHourGlass.stream() - .collect(Collectors.summingInt(Integer::intValue)); + int hourGlassSum = + currentHourGlass.stream().collect(Collectors.summingInt(Integer::intValue)); if (maxHourGlassSum == null || hourGlassSum > maxHourGlassSum) { maxHourGlassSum = hourGlassSum; diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTriplets.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTriplets.java index 60ce2ff8..a557a995 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTriplets.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTriplets.java @@ -8,18 +8,14 @@ * CountTriplets. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1.md/]] - * + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1.md/]] * @link Solution Notes - * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1-solution-notes.md/]] + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1-solution-notes.md/]] */ public class CountTriplets { - private CountTriplets() { - } + private CountTriplets() {} - /** - * CountTriplets. - */ + /** CountTriplets. */ static long countTriplets(List arr, long r) { Map aCounter = new HashMap<>(); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForce.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForce.java index a05ac798..6631c594 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForce.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForce.java @@ -6,17 +6,13 @@ * CountTripletsBruteForce. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1.md/]] - * + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1.md/]] * @see CountTriplets */ public class CountTripletsBruteForce { - private CountTripletsBruteForce() { - } + private CountTripletsBruteForce() {} - /** - * CountTriples. - */ + /** CountTriples. */ static long countTriplets(List arr, long r) { long size = arr.size(); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueries.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueries.java index c4451c55..5ad2f661 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueries.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueries.java @@ -9,11 +9,10 @@ * FrequencyQueries. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/frequency-queries.md]] + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/frequency-queries.md]] */ public class FrequencyQueries { - private FrequencyQueries() { - } + private FrequencyQueries() {} private static final long __INITIAL__ = 1L; @@ -102,9 +101,7 @@ static FrequencyQueries factory() { return fq; } - /** - * FrequencyQueries. - */ + /** FrequencyQueries. */ static List freqQuery(List> queries) { FrequencyQueries fq = FrequencyQueries.factory(); @@ -126,8 +123,7 @@ static List freqQuery(List> queries) { fq.select(value); break; default: - throw new IllegalArgumentException( - "Operation %d not supported".formatted(operation)); + throw new IllegalArgumentException("Operation %d not supported".formatted(operation)); } } diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNote.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNote.java index 58852e62..c5b8b1cc 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNote.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNote.java @@ -8,12 +8,11 @@ /** * RansomNote. * - * @link Problem definition [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.md]] + * @link Problem definition + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci-ransom-note.md]] */ public class RansomNote { - /** - * InvalidValueException. - */ + /** InvalidValueException. */ public class InvalidValueException extends Exception { // constructor for the InvalidAgeException class public InvalidValueException(String msg) { @@ -21,15 +20,12 @@ public InvalidValueException(String msg) { } } - protected RansomNote() { - } + protected RansomNote() {} private static final String YES = "Yes"; private static final String NO = "No"; - /** - * checkMagazineCompute. - */ + /** checkMagazineCompute. */ public static boolean checkMagazineCompute(List magazine, List note) { Map dictionary = new HashMap<>(); @@ -54,9 +50,7 @@ public static boolean checkMagazineCompute(List magazine, List n return true; } - /** - * checkMagazine. - */ + /** checkMagazine. */ public static String checkMagazine(List magazine, List note) { return checkMagazineCompute(magazine, note) ? YES : NO; } diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagrams.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagrams.java index b62e7e35..f09ab1e2 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagrams.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagrams.java @@ -11,15 +11,15 @@ /** * SherlockAndAnagrams. * - * @link Problem definition [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.md]] - * @link Solution notes [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams-solution-notes.md]] + * @link Problem definition + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.md]] + * @link Solution notes + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams-solution-notes.md]] */ public class SherlockAndAnagrams { private SherlockAndAnagrams() {} - /** - * factorial(). - */ + /** factorial(). */ public static BigInteger factorial(int number) { BigInteger result = BigInteger.ONE; for (int i = 1; i <= number; i++) { @@ -29,9 +29,7 @@ public static BigInteger factorial(int number) { return result; } - /** - * sherlockAndAnagrams. - */ + /** sherlockAndAnagrams. */ public static int sherlockAndAnagrams(String sWord) { Map> candidates = new HashMap<>(); @@ -43,10 +41,8 @@ public static int sherlockAndAnagrams(String sWord) { // Add substrings to a candidate list. // two strings are anagrams if sorted strings are the same. - String anagramCandidate = Arrays.stream(substr.split("")) - .sorted() - .collect(Collectors.joining()); - + String anagramCandidate = + Arrays.stream(substr.split("")).sorted().collect(Collectors.joining()); // Append candidates to dictionary by "sorted string" key if (candidates.containsKey(anagramCandidate)) { @@ -68,9 +64,10 @@ public static int sherlockAndAnagrams(String sWord) { if (quantityOfAnagrams > 1) { // Binomial coefficient: https://en.wikipedia.org/wiki/Binomial_coefficient - int count = factorial(quantityOfAnagrams).divide( - (factorial(k).multiply(factorial(quantityOfAnagrams - k))) - ).intValue(); + int count = + factorial(quantityOfAnagrams) + .divide((factorial(k).multiply(factorial(quantityOfAnagrams - k)))) + .intValue(); total += count; } } diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStrings.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStrings.java index 392da737..02e7c691 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStrings.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStrings.java @@ -6,8 +6,10 @@ /** * TwoStrings. * - * @link Problem definition [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/two-strings.md]] - * @link Solution notes [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/two-strings-solution-notes.md]] + * @link Problem definition + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/two-strings.md]] + * @link Solution notes + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/two-strings-solution-notes.md]] */ public class TwoStrings { private TwoStrings() {} @@ -15,9 +17,7 @@ private TwoStrings() {} private static final String YES = "YES"; private static final String NO = "NO"; - /** - * twoStringsCompute. - */ + /** twoStringsCompute. */ public static boolean twoStringsCompute(String s1, String s2) { Set dictionary = new HashSet<>(); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/AngryFlorist.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/AngryFlorist.java index 813dee55..1c81c99c 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/AngryFlorist.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/AngryFlorist.java @@ -8,16 +8,13 @@ * AngryFlorist. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md]] + * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/angry-children.md]] */ public class AngryFlorist { - private AngryFlorist() { - } + private AngryFlorist() {} - /** - * maxMin. - */ + /** maxMin. */ public static int maxMin(int k, List arr) { List sortedNums = arr.stream().collect(Collectors.toList()); Collections.sort(sortedNums); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/GreedyFlorist.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/GreedyFlorist.java index 4e0e6453..f20c3381 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/GreedyFlorist.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/GreedyFlorist.java @@ -9,18 +9,15 @@ * GreedyFlorist. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist.md]] + * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist.md]] * @link Solution notes - * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist-solution-notes.md]] + * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/greedy-florist-solution-notes.md]] */ public class GreedyFlorist { - private GreedyFlorist() { - } + private GreedyFlorist() {} - /** - * getMinimumCost. - */ + /** getMinimumCost. */ public static int getMinimumCost(int k, int[] c) { List flowers = Arrays.stream(c).boxed().collect(Collectors.toList()); Collections.sort(flowers); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalance.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalance.java index 4017e320..4955269e 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalance.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalance.java @@ -8,7 +8,8 @@ /** * LuckBalance. * - * @link Problem definition [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/luck-balance.md]] + * @link Problem definition + * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/luck-balance.md]] */ public class LuckBalance { @@ -30,12 +31,13 @@ public int getImportant() { } } - private LuckBalance() { } + private LuckBalance() {} /** * luckBalance. * - * @link https://www.baeldung.com/java-sort-collection-multiple-fields#use-comparatorcomparing-and-lambda-expression + * @link + * https://www.baeldung.com/java-sort-collection-multiple-fields#use-comparatorcomparing-and-lambda-expression */ public static int luckBalance(int k, List> contests) { List importantCompetitions = new ArrayList<>(); @@ -52,14 +54,14 @@ public static int luckBalance(int k, List> contests) { } } - importantCompetitions = importantCompetitions - .stream() - .sorted( - Comparator - .comparing(Competition::getImportant).reversed() - .thenComparing(Competition::getLuck).reversed() - ) - .collect(Collectors.toList()); + importantCompetitions = + importantCompetitions.stream() + .sorted( + Comparator.comparing(Competition::getImportant) + .reversed() + .thenComparing(Competition::getLuck) + .reversed()) + .collect(Collectors.toList()); int total = 0; int size = importantCompetitions.size(); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArray.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArray.java index a4cc3e14..285e8518 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArray.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArray.java @@ -8,16 +8,13 @@ * MinimumAbsoluteDifferenceInAnArray. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/minimum-absolute-difference-in-an-array.md]] + * [[docs/hackerrank/interview_preparation_kit/greedy_algorithms/minimum-absolute-difference-in-an-array.md]] */ public class MinimumAbsoluteDifferenceInAnArray { - private MinimumAbsoluteDifferenceInAnArray() { - } + private MinimumAbsoluteDifferenceInAnArray() {} - /** - * minimumAbsoluteDifference. - */ + /** minimumAbsoluteDifference. */ public static int minimumAbsoluteDifference(List arr) { List sortedNums = arr.stream().collect(Collectors.toList()); Collections.sort(sortedNums); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBits.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBits.java index 9794f682..04a2a920 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBits.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBits.java @@ -4,15 +4,13 @@ * AngryFlorist. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/miscellaneous/flipping-bits.md]] + * [[docs/hackerrank/interview_preparation_kit/miscellaneous/flipping-bits.md]] */ public class FlippingBits { private FlippingBits() {} - /** - * flippingBits. - */ + /** flippingBits. */ public static long flippingBits(long n) { String binaryString = Long.toBinaryString(n); binaryString = String.format("%32s", binaryString); // Ensure 32 bits diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsAlternative.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsAlternative.java index 3d64fbe3..b9932018 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsAlternative.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsAlternative.java @@ -4,15 +4,13 @@ * AngryFlorist. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/miscellaneous/flipping-bits.md]] + * [[docs/hackerrank/interview_preparation_kit/miscellaneous/flipping-bits.md]] */ public class FlippingBitsAlternative { private FlippingBitsAlternative() {} - /** - * flippingBits. - */ + /** flippingBits. */ public static long flippingBits(long n) { return ~n & 0xFFFFFFFFL; // Use bitwise NOT and mask to ensure 32-bit unsigned result } diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/TimeComplexityPrimality.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/TimeComplexityPrimality.java index 7415756d..0230b548 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/TimeComplexityPrimality.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/interview_preparation_kit/miscellaneous/TimeComplexityPrimality.java @@ -1,11 +1,10 @@ - package ae.hackerrank.interview_preparation_kit.miscellaneous; /** * TimeComplexityPrimality. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/miscellaneous/ctci-big-o.md]] + * [[docs/hackerrank/interview_preparation_kit/miscellaneous/ctci-big-o.md]] */ public class TimeComplexityPrimality { @@ -38,10 +37,7 @@ private static Integer primeFactor(int n) { return maxPrimeFactor; } - - /** - * primality. - */ + /** primality. */ public static String primality(int n) { Integer pf = primeFactor(n); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler001.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler001.java index becb44c8..585a49b3 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler001.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler001.java @@ -11,9 +11,7 @@ public class Euler001 { private Euler001() {} - /** - * Greatest common divisor. - */ + /** Greatest common divisor. */ private static Long gcd(Integer a, Integer b) { if (a == 0) { return (long) b; @@ -22,27 +20,24 @@ private static Long gcd(Integer a, Integer b) { return gcd(b % a, a); } - /** - * Sum of Arithmetic Progression series. - */ + /** Sum of Arithmetic Progression series. */ private static Long sumOfArithmeticProgression(Long numberOfTerms, Long distance) { long n = numberOfTerms / distance; return (long) ((n) * (1 + n) * distance / 2); } - /** - * Multiples of 3 and 5. - */ + /** Multiples of 3 and 5. */ public static Long euler001(Integer a, Integer b, Integer n) { Long result = null; n = n - 1; Long lcm = (a * b) / gcd(a, b); - result = sumOfArithmeticProgression((long) n, (long) a) - + sumOfArithmeticProgression((long) n, (long) b) - - sumOfArithmeticProgression((long) n, lcm); + result = + sumOfArithmeticProgression((long) n, (long) a) + + sumOfArithmeticProgression((long) n, (long) b) + - sumOfArithmeticProgression((long) n, lcm); String log = String.format("Problem 001 solved: %d", result); Log.info(log); @@ -51,4 +46,4 @@ public static Long euler001(Integer a, Integer b, Integer n) { } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler002.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler002.java index 22417ed4..060d6e5e 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler002.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler002.java @@ -30,9 +30,7 @@ private static Long fibbo(Integer n) { return total; } - /** - * Even Fibonacci numbers. - */ + /** Even Fibonacci numbers. */ public static Long euler002(Integer n) { Long result = fibbo(n); @@ -43,4 +41,4 @@ public static Long euler002(Integer n) { } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler003.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler003.java index 65a1c0af..08fe1fcd 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler003.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/projecteuler/Euler003.java @@ -34,12 +34,10 @@ private static Long primeFactor(Long n) { return maxPrimeFactor; } - /** - * Even Fibonacci numbers. - */ + /** Even Fibonacci numbers. */ public static Long euler003(long n) { return primeFactor(n); } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/BirthdayCakeCandles.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/BirthdayCakeCandles.java index ce98a3c3..9adfd53c 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/BirthdayCakeCandles.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/BirthdayCakeCandles.java @@ -11,9 +11,7 @@ public class BirthdayCakeCandles { private BirthdayCakeCandles() {} - /** - * birthdayCakeCandles. - */ + /** birthdayCakeCandles. */ public static int birthdayCakeCandles(List candles) { if (candles == null || candles.isEmpty()) { throw new IllegalArgumentException("Parameter cannot be empty"); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/CompareTriplets.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/CompareTriplets.java index 7ddfc3da..572cd501 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/CompareTriplets.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/CompareTriplets.java @@ -12,9 +12,7 @@ public class CompareTriplets { private CompareTriplets() {} - /** - * compareTriplets. - */ + /** compareTriplets. */ public static List compareTriplets(List a, List b) { List awards = Arrays.asList(0, 0); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/DiagonalDifference.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/DiagonalDifference.java index 12844294..afe07fed 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/DiagonalDifference.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/DiagonalDifference.java @@ -11,9 +11,7 @@ public class DiagonalDifference { private DiagonalDifference() {} - /** - * diagonalDifference. - */ + /** diagonalDifference. */ public static int diagonalDifference(List> matrix) { int diag1 = 0; int diag2 = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/PlusMinus.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/PlusMinus.java index 30db4f45..7d73df0f 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/PlusMinus.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/PlusMinus.java @@ -13,9 +13,7 @@ public class PlusMinus { private PlusMinus() {} - /** - * plusMinus. - */ + /** plusMinus. */ public static String plusMinus(List arr) { int positives = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SimpleArraySum.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SimpleArraySum.java index 2551e033..1366a791 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SimpleArraySum.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SimpleArraySum.java @@ -12,9 +12,7 @@ public class SimpleArraySum { private SimpleArraySum() {} - /** - * simpleArraySum. - */ + /** simpleArraySum. */ public static int simpleArraySum(List ar) { int total = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SolveMeFirst.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SolveMeFirst.java index 18ac6d6f..f42197e7 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SolveMeFirst.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/SolveMeFirst.java @@ -9,9 +9,7 @@ public class SolveMeFirst { private SolveMeFirst() {} - /** - * solveMeFirst. - */ + /** solveMeFirst. */ public static int solveMeFirst(int a, int b) { return a + b; } diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/Staircase.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/Staircase.java index 8c81337a..ea380823 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/Staircase.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/Staircase.java @@ -12,9 +12,7 @@ public class Staircase { private Staircase() {} - /** - * staircase. - */ + /** staircase. */ public static String staircase(int n) { List result = new ArrayList<>(); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/TimeConversion.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/TimeConversion.java index b5088550..8024011b 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/TimeConversion.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/TimeConversion.java @@ -1,6 +1,5 @@ package ae.hackerrank.warmup; - /** * Time Conversion. * @@ -10,9 +9,7 @@ public class TimeConversion { private TimeConversion() {} - /** - * timeConversion. - */ + /** timeConversion. */ public static String timeConversion(String input) { String meridian = input.substring(input.length() - 2); meridian = meridian.toLowerCase(); diff --git a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/VeryBigSum.java b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/VeryBigSum.java index 34bfad65..d9b25652 100644 --- a/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/VeryBigSum.java +++ b/algorithm-exercises-java/src/main/java/ae/hackerrank/warmup/VeryBigSum.java @@ -11,9 +11,7 @@ public class VeryBigSum { private VeryBigSum() {} - /** - * aVeryBigSum. - */ + /** aVeryBigSum. */ public static long aVeryBigSum(List ar) { long total = 0L; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0001.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0001.java index 2d701acf..f40072a5 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0001.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0001.java @@ -11,9 +11,7 @@ public class Problem0001 { private Problem0001() {} - /** - * Problem0001. - */ + /** Problem0001. */ public static Integer problem0001(Integer top) { Integer result = 0; Integer i; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0002.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0002.java index a92faf99..febac1fb 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0002.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0002.java @@ -11,9 +11,7 @@ public class Problem0002 { private Problem0002() {} - /** - * Problem template method. - */ + /** Problem template method. */ public static Integer problem0002(int top) { int i = 0; @@ -43,5 +41,4 @@ public static Integer problem0002(int top) { return evenSum; } - } diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0003.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0003.java index 745961db..227e42f6 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0003.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0003.java @@ -5,7 +5,6 @@ import java.util.Arrays; import util.Log; - /** * Largest prime factor. * @@ -15,10 +14,7 @@ public class Problem0003 { private Problem0003() {} - - /** - * Problem 0003. - */ + /** Problem 0003. */ public static Long problem0003(Long top) { Long[] divs = Divisors.divisors(top); @@ -54,5 +50,4 @@ public static Long problem0003(Long top) { return null; } - } diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0004.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0004.java index 57b8f3f2..b8526ef7 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0004.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0004.java @@ -21,10 +21,7 @@ public class Problem0004 { private Problem0004() {} - - /** - * Problem template method. - */ + /** Problem template method. */ public static Integer problem0004(int bottom, int top) { Integer foundi = null; Integer foundj = null; @@ -57,12 +54,10 @@ public static Integer problem0004(int bottom, int top) { i -= 1; } - String log = String.format( - "Problem 0004 Largest Palindrome => %d 𝗑 %d = %d in %d cycles", - foundi, - foundj, - foundPalindrome, - cycles); + String log = + String.format( + "Problem 0004 Largest Palindrome => %d 𝗑 %d = %d in %d cycles", + foundi, foundj, foundPalindrome, cycles); Log.info(log); diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005.java index 800d2bff..a05d5443 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005.java @@ -16,10 +16,7 @@ public class Problem0005 { private Problem0005() {} - - /** - * countOccurrences. - */ + /** countOccurrences. */ public static Map countOccurrences(List numbers) { // Crear un mapa para realizar el recuento de ocurrencias Map occurrences = new HashMap<>(); @@ -32,30 +29,25 @@ public static Map countOccurrences(List numbers) { return occurrences; } - /** - * mixOccurrences. - */ + /** mixOccurrences. */ public static Map mixOccurrences( - Map listA, - Map listB) { + Map listA, Map listB) { Map occurrences = new HashMap<>(); listA.forEach(occurrences::put); - listB.forEach((keyB, valueB) -> { - Integer valueA = occurrences.getOrDefault(keyB, null); - Integer max = (valueA != null && valueA > valueB) ? valueA : valueB; + listB.forEach( + (keyB, valueB) -> { + Integer valueA = occurrences.getOrDefault(keyB, null); + Integer max = (valueA != null && valueA > valueB) ? valueA : valueB; - occurrences.put(keyB, max); - }); + occurrences.put(keyB, max); + }); return occurrences; } - - /** - * Problem 0005. - */ + /** Problem 0005. */ public static Integer problem0005(Integer bottom, Integer top) { String log; Integer result = null; @@ -69,10 +61,8 @@ public static Integer problem0005(Integer bottom, Integer top) { Map primeFactorsCount = countOccurrences(Arrays.asList(primeFactors)); - minimumPrimeFactorsCollector = mixOccurrences( - minimumPrimeFactorsCollector, - primeFactorsCount - ); + minimumPrimeFactorsCollector = + mixOccurrences(minimumPrimeFactorsCollector, primeFactorsCount); log = String.format("%s", minimumPrimeFactorsCollector.toString()); Log.info(log); @@ -91,5 +81,4 @@ public static Integer problem0005(Integer bottom, Integer top) { return result; } - } diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005Simple.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005Simple.java index 49070e9d..2de147e8 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005Simple.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0005Simple.java @@ -13,10 +13,7 @@ public class Problem0005Simple { private Problem0005Simple() {} - - /** - * Problem 0005. - */ + /** Problem 0005. */ public static Integer problem0005(Integer bottom, Integer top, Integer startFrom) { Integer found = null; boolean fail; @@ -52,7 +49,6 @@ public static Integer problem0005(Integer bottom, Integer top, Integer startFrom return found; } - } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0006.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0006.java index f670dc39..df890629 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0006.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0006.java @@ -19,10 +19,7 @@ class Problem0006 { private Problem0006() {} - - /** - * Problem 0006. - */ + /** Problem 0006. */ public static Integer problem0006(Integer bottom, Integer top) { Integer answer = 0; @@ -46,10 +43,9 @@ public static Integer problem0006(Integer bottom, Integer top) { log = String.format("Square Of Sum of first %d = %d", top, squareOfSum); Log.debug(log); - log = String.format("Difference found %d - %d = %d", - squareOfSum, - sumOfSquares, - squareOfSum - sumOfSquares); + log = + String.format( + "Difference found %d - %d = %d", squareOfSum, sumOfSquares, squareOfSum - sumOfSquares); Log.debug(log); log = String.format("Problem 00006 solved: %d", answer); @@ -57,5 +53,4 @@ public static Integer problem0006(Integer bottom, Integer top) { return answer; } - } diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0007.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0007.java index 1af91377..34b7f472 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0007.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0007.java @@ -13,10 +13,7 @@ public class Problem0007 { private Problem0007() {} - - /** - * Problem 0007. - */ + /** Problem 0007. */ public static Integer problem0007(Integer top) { ArrayList primes = new ArrayList<>(); Integer i = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0008.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0008.java index ba5bbed1..f169dbef 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0008.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0008.java @@ -13,10 +13,7 @@ public class Problem0008 { private Problem0008() {} - - /** - * Problem template method. - */ + /** Problem template method. */ public static Long problem0008(String number, Integer interval) { String[] digits = number.split(""); Integer bottom = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0009.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0009.java index f5edea10..a0bc04e9 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0009.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0009.java @@ -11,7 +11,6 @@ public class Problem0009 { private Problem0009() {} - private class Triplet { Integer ta; @@ -29,9 +28,7 @@ public boolean isPythagoreanTriplet() { } } - /** - * Problem 0009. - */ + /** Problem 0009. */ public static Integer problem0009(Integer limit) { String log; Integer a = 1; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0010.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0010.java index d0a36a28..40487fac 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0010.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0010.java @@ -14,10 +14,7 @@ public class Problem0010 { private Problem0010() {} - - /** - * Problem 0010. - */ + /** Problem 0010. */ public static Long problem0010(Long bottom, Long top) { ArrayList primes = new ArrayList<>(); diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0011.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0011.java index 6d3476f8..224df6cc 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0011.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0011.java @@ -11,7 +11,6 @@ public class Problem0011 { private Problem0011() {} - /** * Problem 0011. * @@ -39,17 +38,11 @@ public static Integer problem0011(Integer[][] squareMatrix, Integer interval) int diag1Acum = 1; int diag2Acum = 1; for (int k = 0; k < quadrantSize; k++) { - log = String.format( - "diag1 coordinate: (i, j) = (%d, %d)", - i + k, - j + k - ); + log = String.format("diag1 coordinate: (i, j) = (%d, %d)", i + k, j + k); Log.debug(log); - log = String.format( - "diag2 coordinate: (i, j) = (%d, %d)", - i + k, - j + (quadrantSize - 1) - k - ); + log = + String.format( + "diag2 coordinate: (i, j) = (%d, %d)", i + k, j + (quadrantSize - 1) - k); Log.debug(log); diag1Acum *= squareMatrix[i + k][j + k]; @@ -63,17 +56,9 @@ public static Integer problem0011(Integer[][] squareMatrix, Integer interval) int horizontalAcum = 1; for (int l = 0; l < quadrantSize; l++) { - log = String.format( - "vertical coordinate: (i, j) = (%d, %d)", - i + k, - j + l - ); + log = String.format("vertical coordinate: (i, j) = (%d, %d)", i + k, j + l); Log.debug(log); - log = String.format( - "horizontal coordinate: (i, j) = (%d, %d)", - i + l, - j + k - ); + log = String.format("horizontal coordinate: (i, j) = (%d, %d)", i + l, j + k); Log.debug(log); verticalAcum *= squareMatrix[i + k][j + l]; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0012.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0012.java index 377bc799..7d57c097 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0012.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0012.java @@ -12,10 +12,7 @@ public class Problem0012 { private Problem0012() {} - - /** - * Problem 0012. - */ + /** Problem 0012. */ public static Long problem0012(Long top) { Long count = (long) 0; Long triangular = (long) 0; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0013.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0013.java index 0e4e87ed..443ff951 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0013.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0013.java @@ -15,20 +15,14 @@ public class Problem0013 { private Problem0013() {} - - /** - * Problem 0013. - */ + /** Problem 0013. */ public static String problem0013(String[] arrayOfNumbers, Integer firtsDigits) { BigNum sum = new BigNum(0); sum = sum.bigSumMany(arrayOfNumbers); List first = Arrays.asList(sum.toArray()).subList(0, firtsDigits); - String numberString = first - .stream().map(String::valueOf) - .collect(Collectors.joining("")); - + String numberString = first.stream().map(String::valueOf).collect(Collectors.joining("")); String log; log = String.format("First %d digits of huge sume are %s", firtsDigits, first); diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0014.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0014.java index 4de711de..9817c2b9 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0014.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0014.java @@ -12,10 +12,7 @@ public class Problem0014 { private Problem0014() {} - - /** - * Problem 0013. - */ + /** Problem 0013. */ public static Long problem0014(Integer bottom, Integer top) throws IllegalArgumentException { String log; @@ -29,7 +26,7 @@ public static Long problem0014(Integer bottom, Integer top) throws IllegalArgume for (int i = bottom; i < top; i++) { long c = i; - ArrayList sequence = new ArrayList<>(); + ArrayList sequence = new ArrayList<>(); sequence.add(c); do { c = Collatz.collatz(c); @@ -44,10 +41,8 @@ public static Long problem0014(Integer bottom, Integer top) throws IllegalArgume } } - log = String.format( - "Large sequence found: %s has %d elements", - maxSequence, - maxSequence.size()); + log = + String.format("Large sequence found: %s has %d elements", maxSequence, maxSequence.size()); Log.debug(log); // return firt element diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0015.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0015.java index 786e77d5..df22056d 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0015.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0015.java @@ -11,10 +11,7 @@ public class Problem0015 { private Problem0015() {} - - /** - * Problem 0015. - */ + /** Problem 0015. */ public static Long problem0015(Integer gridSide) { int limit; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0016.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0016.java index de35abe7..a6ea575a 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0016.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0016.java @@ -3,7 +3,6 @@ import ae.projecteuler.helper.BigNum; import util.Log; - /** * Problem 0016. * @@ -13,10 +12,7 @@ public class Problem0016 { private Problem0016() {} - - /** - * Problem 0016. - */ + /** Problem 0016. */ public static String problem0016(int base, int exponent) { BigNum power = new BigNum(base).bigPower(exponent); diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0017.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0017.java index b77c0130..0b0f6511 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0017.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0017.java @@ -12,10 +12,7 @@ public class Problem0017 { private Problem0017() {} - - /** - * Problem 0017. - */ + /** Problem 0017. */ public static Integer problem0017(int init, int last) throws Exception { int acum = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0018.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0018.java index 4cebb0f9..4f90e45b 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0018.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0018.java @@ -5,7 +5,6 @@ import java.util.Arrays; import util.Log; - /** * Problem 0018. * @@ -15,10 +14,7 @@ public class Problem0018 { private Problem0018() {} - - /** - * Problem template method. - */ + /** Problem template method. */ public static Integer problem0018(Integer[][] triangle) { String log; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0019.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0019.java index 60825182..4d175056 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0019.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0019.java @@ -19,8 +19,7 @@ private Problem0019() {} private static Map copyDaysInMonth() { Map daysInMonth = new LinkedHashMap<>(); - Set> - entries = ae.projecteuler.constants.Date.daysInMonth().entrySet(); + Set> entries = ae.projecteuler.constants.Date.daysInMonth().entrySet(); for (Map.Entry mapEntry : entries) { daysInMonth.put(mapEntry.getKey(), mapEntry.getValue()); } @@ -28,14 +27,8 @@ private static Map copyDaysInMonth() { return daysInMonth; } - /** - * Problem 0019. - */ - public static Integer problem0019( - int dayOfWeek, // __SUNDAY__, - int sinceYear, // 1901, - int untilYear // 2000 - ) { + /** Problem 0019. */ + public static Integer problem0019(int dayOfWeek, int sinceYear, int untilYear) { String log; int resultCount = 0; int accumulatedRemainder = 0; @@ -64,7 +57,6 @@ public static Integer problem0019( } resultCount += 1; } - } } diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0020.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0020.java index 39ec048b..4d914fc7 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0020.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0020.java @@ -12,10 +12,7 @@ public class Problem0020 { private Problem0020() {} - - /** - * Problem 0020. - */ + /** Problem 0020. */ public static BigNum problem0020(int limit) { String log; BigNum factorial = BigNum.bigFactorial(limit); diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0021.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0021.java index 1ad5eaa4..23c96792 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0021.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0021.java @@ -11,7 +11,6 @@ import java.util.Set; import util.Log; - /** * Amicable numbers. * @@ -21,10 +20,7 @@ public class Problem0021 { private Problem0021() {} - - /** - * Problem 0021. - */ + /** Problem 0021. */ public static String problem0021(int start, int limit) { Map properDivisorsSums = new LinkedHashMap<>(); @@ -45,13 +41,9 @@ public static String problem0021(int start, int limit) { String key = mapEntry.getKey(); String value = mapEntry.getValue(); - if ( - !key.equals(value) - && key.equals(properDivisorsSums.get(value)) - ) { + if (!key.equals(value) && key.equals(properDivisorsSums.get(value))) { amicableNumbers.add(key); } - } String log; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0022.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0022.java index 99609036..74d25ef4 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0022.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0022.java @@ -15,10 +15,7 @@ public class Problem0022 { private Problem0022() {} - - /** - * Problem 0022. - */ + /** Problem 0022. */ public static Integer problem0022(String[] listOfNames) { List names = Arrays.asList(listOfNames); Collections.sort(names); diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0023.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0023.java index 1c327853..c86a389c 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0023.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0023.java @@ -17,10 +17,7 @@ public class Problem0023 { private Problem0023() {} - - /** - * Problem 0023. - */ + /** Problem 0023. */ public static Integer problem0023(int underLimit, int superLimit) { ArrayList abundantNumberList = new ArrayList<>(); @@ -35,37 +32,26 @@ public static Integer problem0023(int underLimit, int superLimit) { String log; - log = String.format( - "abundant nums list size => %d", abundantNumberList.size() - ); + log = String.format("abundant nums list size => %d", abundantNumberList.size()); Log.info(log); - log = String.format( - "abundant nums list result: => %s", abundantNumberList - ); + log = String.format("abundant nums list result: => %s", abundantNumberList); Log.debug(log); ArrayList sumsAbundantNums = new ArrayList<>(); // Produce a list of sums of pair of abundant numbers below limit for (int i = 0; i < abundantNumberList.size(); i++) { - for (int j = 0; - j < abundantNumberList.size(); - j++ - ) { + for (int j = 0; j < abundantNumberList.size(); j++) { if (abundantNumberList.get(i) + abundantNumberList.get(j) <= superLimit) { sumsAbundantNums.add(abundantNumberList.get(i) + abundantNumberList.get(j)); } } } - log = String.format( - "sumsAbundantNums size => %d", abundantNumberList.size() - ); + log = String.format("sumsAbundantNums size => %d", abundantNumberList.size()); Log.info(log); - log = String.format( - "sumsAbundantNums => %s", abundantNumberList - ); + log = String.format("sumsAbundantNums => %s", abundantNumberList); Log.debug(log); // ///////////////// @@ -85,13 +71,13 @@ public static Integer problem0023(int underLimit, int superLimit) { // with no duplicates to the list sumsAbundantNums.addAll(set); - log = String.format( - "sumsAbundantNums size: %d. result => %s", - sumsAbundantNums.size(), - sumsAbundantNums); + log = + String.format( + "sumsAbundantNums size: %d. result => %s", sumsAbundantNums.size(), sumsAbundantNums); Log.debug(log); - // All numbers below limit that not present in list of sums of pair of abundant numbers + // All numbers below limit that not present in list of sums of pair of abundant + // numbers ArrayList found = new ArrayList<>(); for (int i = 1; i <= superLimit; i++) { diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0024.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0024.java index 3bcf177f..b64a6dc0 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0024.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0024.java @@ -12,7 +12,6 @@ public class Problem0024 { private Problem0024() {} - static Long factorial(long n) { long out = 1L; while (n > 1) { @@ -24,8 +23,7 @@ static Long factorial(long n) { static String permute(String symbols, long target) { StringBuilder answer = new StringBuilder(); - ArrayList choices = - new ArrayList<>(Arrays.asList(String.valueOf(symbols).split(""))); + ArrayList choices = new ArrayList<>(Arrays.asList(String.valueOf(symbols).split(""))); long min = 0; while (!choices.isEmpty()) { @@ -43,13 +41,8 @@ static String permute(String symbols, long target) { return answer.toString(); } - /** - * Problem 0024. - */ - public static String problem0024( - String inputElements, - Integer inputPermutationToFind - ) { + /** Problem 0024. */ + public static String problem0024(String inputElements, Integer inputPermutationToFind) { return Problem0024.permute(inputElements, inputPermutationToFind); } } diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/constants/Date.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/constants/Date.java index 803b8625..0f902938 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/constants/Date.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/constants/Date.java @@ -3,9 +3,7 @@ import java.util.LinkedHashMap; import java.util.Map; -/** - * Dates. - */ +/** Dates. */ public class Date { private Date() {} @@ -30,8 +28,7 @@ private Date() {} public static final int NOVEMBER = 10; public static final int DECEMBER = 11; - protected static final Map - DAYS_IN_MONTH = new LinkedHashMap<>(); + protected static final Map DAYS_IN_MONTH = new LinkedHashMap<>(); static { DAYS_IN_MONTH.put("JANUARY", 31); diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0011Data.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0011Data.java index 72ba5036..b0bf27b7 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0011Data.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0011Data.java @@ -42,4 +42,4 @@ public static Integer[][] getProblem11WrongData() { return Problem0011Data.wrong_data; } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0013Data.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0013Data.java index 92272b57..af4ab332 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0013Data.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0013Data.java @@ -116,4 +116,4 @@ public static String[] getProblem13Data() { return Problem0013Data.data; } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0018Data.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0018Data.java index 47ebc0f9..a75dba2c 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0018Data.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0018Data.java @@ -31,4 +31,4 @@ public static Integer[][] getProblem18Data() { return Problem0018Data.data; } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0022Data.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0022Data.java index 1415bb29..3a8b0772 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0022Data.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/data/Problem0022Data.java @@ -5179,4 +5179,4 @@ public static String[] getProblem22Data() { return Problem0022Data.data; } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/BigNum.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/BigNum.java index 9675fb58..c5418ea0 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/BigNum.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/BigNum.java @@ -5,17 +5,13 @@ import java.util.List; import java.util.stream.Collectors; -/** - * BigNums helper. - */ +/** BigNums helper. */ public class BigNum { int cycles = 0; List value = new ArrayList<>(); - /** - * Big number from string. - */ + /** Big number from string. */ public BigNum(String strNumber) { // reset value this.value = new ArrayList<>(); @@ -33,56 +29,39 @@ public BigNum(List number) { this.value = number; } - /** - * Get raw internal value. - */ + /** Get raw internal value. */ private List getInternalValue() { return this.value; } - /** - * Get intervanl value as Array. - */ + /** Get intervanl value as Array. */ public Integer[] toArray() { List valueFound = this.getInternalValue(); return valueFound.toArray(new Integer[valueFound.size()]); } - /** - * Get value as String. - */ + /** Get value as String. */ public String toString() { - return this.value - .stream() - .map(Object::toString) - .collect(Collectors.joining("")); + return this.value.stream().map(Object::toString).collect(Collectors.joining("")); } - /** - * Calculate the sum of internal value with a new. - */ + /** Calculate the sum of internal value with a new. */ public BigNum bigSum(Integer number) { return this.bigSum(String.valueOf(number)); } - /** - * Calculate the sum of internal value with a new. - */ + /** Calculate the sum of internal value with a new. */ public BigNum bigSum(String strNumber) { return this.bigSum(new BigNum(strNumber).getInternalValue()); } - /** - * Calculate the sum of internal value with a new. - */ + /** Calculate the sum of internal value with a new. */ public BigNum bigSum(BigNum bigNum) { return this.bigSum(bigNum.getInternalValue()); } - /** - * Calculate the sum of internal value with a new. - */ + /** Calculate the sum of internal value with a new. */ public BigNum bigSum(List numberList) { List a = this.getInternalValue(); List b = numberList; @@ -129,9 +108,7 @@ public BigNum bigSum(List numberList) { return this; } - /** - * Calculate the sum of many BigNum as a list of strings. - */ + /** Calculate the sum of many BigNum as a list of strings. */ public BigNum bigSumMany(String[] strNumberArr) { for (int i = 0; i < strNumberArr.length; i++) { this.bigSum(strNumberArr[i]); @@ -140,9 +117,7 @@ public BigNum bigSumMany(String[] strNumberArr) { return this; } - /** - * Calculate the sum of many BigNum as a list of integers. - */ + /** Calculate the sum of many BigNum as a list of integers. */ public BigNum bigSumMany(Integer[] numberArr) { for (int i = 0; i < numberArr.length; i++) { this.bigSum(numberArr[i]); @@ -151,9 +126,7 @@ public BigNum bigSumMany(Integer[] numberArr) { return this; } - /** - * bigMultiplyRowToBigNum. - */ + /** bigMultiplyRowToBigNum. */ public static BigNum bigMultiplyRowToBigNum(String strNumber, int multiplierDigit) { List number = new BigNum(strNumber).getInternalValue(); Collections.reverse(number); @@ -185,9 +158,7 @@ public static BigNum bigMultiplyRowToBigNum(String strNumber, int multiplierDigi return new BigNum(result); } - /** - * Calculate the sum of many BigNum as a list of strings. - */ + /** Calculate the sum of many BigNum as a list of strings. */ public BigNum bigMultiply(String strNumMultiplier) { String strMultiply = this.toString(); @@ -215,9 +186,7 @@ public BigNum bigMultiply(String strNumMultiplier) { return this.bigSumMany(collector.toArray(new String[collector.size()])); } - /** - * . - */ + /** . */ public BigNum bigPower(int exponent) { BigNum result = new BigNum(1); String base = this.toString(); @@ -229,9 +198,7 @@ public BigNum bigPower(int exponent) { return result; } - /** - * . - */ + /** . */ public static BigNum bigFactorial(int number) { BigNum acum = new BigNum(1); diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Collatz.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Collatz.java index 8e6d031d..39080ecc 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Collatz.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Collatz.java @@ -1,15 +1,11 @@ package ae.projecteuler.helper; -/** - * Collatz helper. - */ +/** Collatz helper. */ public class Collatz { private Collatz() {} - /** - * Collatz of array of numbers. - */ + /** Collatz of array of numbers. */ public static Long collatz(Long n) { if (n % 2 == 0) { diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Divisors.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Divisors.java index 38672700..0ecdeb6b 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Divisors.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Divisors.java @@ -3,9 +3,7 @@ import java.util.ArrayList; import java.util.Arrays; -/** - * Divisors helper. - */ +/** Divisors helper. */ public class Divisors { long cycles = 0; @@ -56,38 +54,30 @@ public Long[] calculateDivisors(Long number) { cycles = i - init; - // sort divisors Long[] answer = divs.toArray(Long[]::new); Arrays.sort(answer); return answer; - } public Long getCycles() { return this.cycles; } - /** - * Calculate divisors of a number. - */ + /** Calculate divisors of a number. */ public static Long[] divisors(Long number) { return new Divisors().calculateDivisors(number); } - /** - * DivisorsAbundance. - */ + /** DivisorsAbundance. */ public enum DivisorsAbundance { DIVISORS_ABUNDANT, DIVISORS_DEFICIENT, DIVISORS_PERFECT; } - /** - * Calculate abundance of a number. - */ + /** Calculate abundance of a number. */ public static DivisorsAbundance abundance(Long number) { Long[] divisors = Divisors.divisors(number); Long divSum = Sum.sum(divisors) - number; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/NaturalNumber.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/NaturalNumber.java index f34f1f4a..46c69a06 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/NaturalNumber.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/NaturalNumber.java @@ -3,9 +3,7 @@ import java.util.ArrayList; // CHECKSTYLE.OFF: JavadocParagraph -/** - * NaturalNumber. - */ +/** NaturalNumber. */ public class NaturalNumber { private Long value = null; @@ -26,8 +24,8 @@ public Long getValue() { /** * Get cycles the next minimal prime factor. * - * If the prime factor has not yet been computed, then it is computed first. - * That is, this function saves the result in an internal cache. + *

If the prime factor has not yet been computed, then it is computed first. That is, this + * function saves the result in an internal cache. */ public Long getNextPrimeFactor() { @@ -39,12 +37,11 @@ public Long getNextPrimeFactor() { } /** - * Get cycles to compute the next divisor. - * The divisor is the inverse number of the prime factor, + * Get cycles to compute the next divisor. The divisor is the inverse number of the prime factor, * by which the target number is divided to obtain the prime factor. * - * If the prime factor has not yet been computed, then it is computed first. - * That is, this function saves the result in an internal cache. + *

If the prime factor has not yet been computed, then it is computed first. That is, this + * function saves the result in an internal cache. */ public Long getNextDivisor() { if (this.nextDivisor == null) { @@ -57,8 +54,8 @@ public Long getNextDivisor() { /** * Get cycles to compute the next minimal Prime Factor of a number. * - * If the prime factor has not yet been computed, then it is computed first. - * That is, this function saves the result in an internal cache. + *

If the prime factor has not yet been computed, then it is computed first. That is, this + * function saves the result in an internal cache. */ public Integer getNextPrimeFactorCycles() { @@ -69,9 +66,7 @@ public Integer getNextPrimeFactorCycles() { return nextPrimeFactorCycles; } - /** - * Compute the next minimal Prime Factor of a number. - */ + /** Compute the next minimal Prime Factor of a number. */ public Long computeNextPrimefactor() { Long top = Math.abs(this.getValue()); @@ -97,9 +92,7 @@ public Long computeNextPrimefactor() { return nextPrimeFactor; } - /** - * Compute a list of prime factors of a number. - */ + /** Compute a list of prime factors of a number. */ public Long[] primeFactors() { Long[] primeFactors = null; ArrayList factors = new ArrayList<>(); @@ -130,9 +123,7 @@ public Long[] primeFactors() { return primeFactors; } - /** - * Get cycles to compute a list of prime factors of a number. - */ + /** Get cycles to compute a list of prime factors of a number. */ public Integer getPrimeFactorCycles() { if (this.primeFactorsCycles == null) { this.primeFactors(); @@ -141,20 +132,16 @@ public Integer getPrimeFactorCycles() { return primeFactorsCycles; } - /** - * Checks if number is prime. - */ + /** Checks if number is prime. */ public boolean isPrime() { Long primeFactor = this.getNextPrimeFactor(); return primeFactor != 1 && primeFactor.equals(this.getValue()); } - /** - * Checks if number is prime. Static way. - */ + /** Checks if number is prime. Static way. */ public static Boolean isPrime(Long number) { return new NaturalNumber(number).isPrime(); } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/NumberToWord.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/NumberToWord.java index c30fe09b..5318c0d3 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/NumberToWord.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/NumberToWord.java @@ -70,9 +70,7 @@ public static String numberToWord(int value) throws Exception { } return String.format( - "%s-%s", - dictionary.get(Integer.toString(dec)), - dictionary.get(Integer.toString(unit))); + "%s-%s", dictionary.get(Integer.toString(dec)), dictionary.get(Integer.toString(unit))); } else if (value <= 999) { // 100 to 999 @@ -80,29 +78,20 @@ public static String numberToWord(int value) throws Exception { int cent = (int) Math.floor((double) value / 100); if (rest == 0) { - return String.format( - "%s %s", - dictionary.get(Integer.toString(cent)), - NumberToWord.CENTS); + return String.format("%s %s", dictionary.get(Integer.toString(cent)), NumberToWord.CENTS); } return String.format( "%s %s and %s", - dictionary.get(Integer.toString(cent)), - NumberToWord.CENTS, - numberToWord(rest) - ); + dictionary.get(Integer.toString(cent)), NumberToWord.CENTS, numberToWord(rest)); } else if (value == 1000) { // up to 1000 int mills = (int) Math.floor((double) value / 1000); - return String.format( - "%s %s", - dictionary.get(Integer.toString(mills)), - NumberToWord.MILLS); + return String.format("%s %s", dictionary.get(Integer.toString(mills)), NumberToWord.MILLS); } throw new IllegalArgumentException("Invalid value"); } } -//CHECKSTYLE.ON: JavadocParagraph +// CHECKSTYLE.ON: JavadocParagraph diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Palindrome.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Palindrome.java index c7e7f99b..45a1cd73 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Palindrome.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Palindrome.java @@ -1,15 +1,13 @@ package ae.projecteuler.helper; -/** - * Palindrome helper. - */ +/** Palindrome helper. */ public class Palindrome { private Palindrome() {} /** - * Checks that a number is a palindrome - * (reads the same in both directions: left-to-right / right-to-left). + * Checks that a number is a palindrome (reads the same in both directions: left-to-right / + * right-to-left). * * @param number Number to test if it is a palindrome * @return Boolean @@ -20,5 +18,4 @@ public static boolean isPalindrome(Long number) { return original.equals(reversed); } - } diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Product.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Product.java index 875367ca..86bce303 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Product.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Product.java @@ -1,14 +1,10 @@ package ae.projecteuler.helper; -/** - * Product helper. - */ +/** Product helper. */ public class Product { private Product() {} - /** - * Product of array of numbers. - */ + /** Product of array of numbers. */ public static Long product(Long[] numList) { if (numList == null || numList.length == 0) { diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Sum.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Sum.java index b84fe220..76a1c57b 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Sum.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/Sum.java @@ -1,14 +1,10 @@ package ae.projecteuler.helper; -/** - * Sum helper. - */ +/** Sum helper. */ public class Sum { private Sum() {} - /** - * Sum of array of numbers. - */ + /** Sum of array of numbers. */ public static Integer sum(Integer[] numList) { if (numList == null || numList.length == 0) { @@ -24,9 +20,7 @@ public static Integer sum(Integer[] numList) { return result; } - /** - * Sum of array of numbers. - */ + /** Sum of array of numbers. */ public static Long sum(Long[] numList) { if (numList == null || numList.length == 0) { diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/WordScore.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/WordScore.java index 0473d680..15cef63d 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/WordScore.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/helper/WordScore.java @@ -2,14 +2,11 @@ import java.util.LinkedHashMap; -/** - * WordScore helper. - */ +/** WordScore helper. */ public class WordScore { private WordScore() {} - private static final LinkedHashMap - _scoreLetter = new LinkedHashMap<>(); + private static final LinkedHashMap _scoreLetter = new LinkedHashMap<>(); static { _scoreLetter.put("A", 1); @@ -40,9 +37,7 @@ private WordScore() {} _scoreLetter.put("Z", 26); } - /** - * WordScore. - */ + /** WordScore. */ public static Integer wordScore(String word) { int result = 0; diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNode.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNode.java index 6c7c1efa..d8707ebe 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNode.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNode.java @@ -1,14 +1,11 @@ package ae.projecteuler.lib; -/** - * BinaryNode. - */ +/** BinaryNode. */ public class BinaryNode { T value; BinaryNode left; BinaryNode right; - BinaryNode() {} BinaryNode(T value) { @@ -64,9 +61,7 @@ public int hashCode() { return this.value.hashCode(); } - /** - * equals. - */ + /** equals. */ public boolean equals(Object obj) { // Same instance if (this == obj) { diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNodeBuilder.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNodeBuilder.java index a80d5465..d6c53a58 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNodeBuilder.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNodeBuilder.java @@ -2,17 +2,12 @@ import java.util.ArrayList; -/** - * BinaryNodeBuilder. - */ +/** BinaryNodeBuilder. */ public class BinaryNodeBuilder { private ArrayList leafCollector = new ArrayList<>(); - private BinaryNode buildBinaryNodeTreeInternal( - T[][] dataTree, - Integer i, - Integer j) { + private BinaryNode buildBinaryNodeTreeInternal(T[][] dataTree, Integer i, Integer j) { if (dataTree == null) { return null; @@ -23,13 +18,9 @@ private BinaryNode buildBinaryNodeTreeInternal( BinaryNode resultNode = new BinaryNode<>(dataTree[i][j]); if (i + 1 < dataTree.length && j + 1 < dataTree[i + 1].length) { - resultNode.setLeft( - this.buildBinaryNodeTreeInternal(dataTree, i + 1, j) - ); + resultNode.setLeft(this.buildBinaryNodeTreeInternal(dataTree, i + 1, j)); - resultNode.setRight( - this.buildBinaryNodeTreeInternal(dataTree, i + 1, j + 1) - ); + resultNode.setRight(this.buildBinaryNodeTreeInternal(dataTree, i + 1, j + 1)); } if (resultNode.isLeaf()) { diff --git a/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNodeWeightBuilder.java b/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNodeWeightBuilder.java index 238b8fe2..4915088d 100644 --- a/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNodeWeightBuilder.java +++ b/algorithm-exercises-java/src/main/java/ae/projecteuler/lib/BinaryNodeWeightBuilder.java @@ -2,19 +2,13 @@ import java.util.ArrayList; -/** - * BinaryNodeBuilder. - */ -public class BinaryNodeWeightBuilder - extends BinaryNodeBuilder { +/** BinaryNodeBuilder. */ +public class BinaryNodeWeightBuilder extends BinaryNodeBuilder { private ArrayList leafCollector = new ArrayList<>(); private BinaryNode buildBinaryNodeTreeWithWeightInternal( - Integer[][] dataTree, - int i, - int j, - int rootValue) { + Integer[][] dataTree, int i, int j, int rootValue) { if (dataTree == null) { return null; @@ -26,22 +20,10 @@ private BinaryNode buildBinaryNodeTreeWithWeightInternal( if (i + 1 < dataTree.length && j + 1 < dataTree[i + 1].length) { resultNode.setLeft( - this.buildBinaryNodeTreeWithWeightInternal( - dataTree, - i + 1, - j, - currentValue - ) - ); + this.buildBinaryNodeTreeWithWeightInternal(dataTree, i + 1, j, currentValue)); resultNode.setRight( - this.buildBinaryNodeTreeWithWeightInternal( - dataTree, - i + 1, - j + 1, - currentValue - ) - ); + this.buildBinaryNodeTreeWithWeightInternal(dataTree, i + 1, j + 1, currentValue)); } if (resultNode.isLeaf()) { @@ -49,7 +31,6 @@ private BinaryNode buildBinaryNodeTreeWithWeightInternal( } return resultNode; - } return null; diff --git a/algorithm-exercises-java/src/main/java/util/JsonLoader.java b/algorithm-exercises-java/src/main/java/util/JsonLoader.java index 2d261f80..43b68b3d 100644 --- a/algorithm-exercises-java/src/main/java/util/JsonLoader.java +++ b/algorithm-exercises-java/src/main/java/util/JsonLoader.java @@ -5,28 +5,18 @@ import java.io.IOException; import java.util.List; -/** - * JsonLoader. - */ +/** JsonLoader. */ public final class JsonLoader { private JsonLoader() {} - /** - * loadJson. - */ + /** loadJson. */ public static List loadJson(String path, Class type) throws IOException { ObjectMapper objectMapper = new ObjectMapper(); - File file = new File( - JsonLoader.class.getClassLoader() - .getResource(path) - .getFile() - ); + File file = new File(JsonLoader.class.getClassLoader().getResource(path).getFile()); ObjectMapper mapper = new ObjectMapper(); - return mapper.readerForListOf(type) - .readValue(objectMapper.readTree(file)); + return mapper.readerForListOf(type).readValue(objectMapper.readTree(file)); } - } diff --git a/algorithm-exercises-java/src/main/java/util/Log.java b/algorithm-exercises-java/src/main/java/util/Log.java index 190aa1c6..a176f683 100644 --- a/algorithm-exercises-java/src/main/java/util/Log.java +++ b/algorithm-exercises-java/src/main/java/util/Log.java @@ -1,8 +1,6 @@ package util; -/** - * Log. - */ +/** Log. */ public class Log { /** @@ -17,9 +15,7 @@ private LoggerSingleton() {} public static final String LOGGER_NAME = "projecteuler"; private static java.util.logging.Logger log; - /** - * Common logger singleton. - */ + /** Common logger singleton. */ @SuppressWarnings({"java:S106", "java:S4792"}) public static java.util.logging.Logger getLogger() { diff --git a/algorithm-exercises-java/src/test/java/ae/Problem0000Test.java b/algorithm-exercises-java/src/test/java/ae/Problem0000Test.java index df2d2eba..0ee2cb7c 100644 --- a/algorithm-exercises-java/src/test/java/ae/Problem0000Test.java +++ b/algorithm-exercises-java/src/test/java/ae/Problem0000Test.java @@ -4,16 +4,14 @@ import org.junit.jupiter.api.Test; - class Problem0000Test { - @Test void problem0000() { + @Test + void problem0000() { Integer answer = null; Integer solutionFound = Problem0000.problem0000(); - assertEquals(answer, solutionFound, - String.format("Problem 0000 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0000 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotationTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotationTest.java index 64a8b70d..7dd58e2a 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotationTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/ArraysLeftRotationTest.java @@ -25,10 +25,13 @@ public static class ArraysLeftRotationTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", "hackerrank", - "interview_preparation_kit", - "arrays", - "ctci_array_left_rotation.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "arrays", + "ctci_array_left_rotation.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, ArraysLeftRotationTestCase.class)); @@ -40,11 +43,11 @@ void testRotLeftOne() { for (ArraysLeftRotationTestCase test : this.testCases) { List solutionFound = ArraysLeftRotation.rotLeftOne(test.input); - assertEquals(test.expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "ArraysLeftRotation.rotLeftOne", - test.input, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s) answer must be: %s" + .formatted("ArraysLeftRotation.rotLeftOne", test.input, test.expected)); } } @@ -56,11 +59,10 @@ void testRotLeft() { List solutionFound = ArraysLeftRotation.rotLeft(input, d); - assertEquals(expected, solutionFound, - "%s(%s, %d) answer must be: %s".formatted( - "ArraysLeftRotation.rotLeftOne", - input, - d, - expected)); + assertEquals( + expected, + solutionFound, + "%s(%s, %d) answer must be: %s" + .formatted("ArraysLeftRotation.rotLeftOne", input, d, expected)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForceTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForceTest.java index f42af7f8..65c3f6da 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForceTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/CrushBruteForceTest.java @@ -26,10 +26,9 @@ public static class CrushBruteForceTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", "hackerrank", - "interview_preparation_kit", - "arrays", - "crush.testcases.json"); + String path = + String.join( + "/", "hackerrank", "interview_preparation_kit", "arrays", "crush.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, CrushBruteForceTestCase.class)); } @@ -37,15 +36,17 @@ void setup() throws IOException { @Test void testArrayManipulation() { for (CrushBruteForceTestCase testCase : testCases) { - long solutionFound = CrushBruteForce - .arrayManipulation(testCase.n, testCase.queries); - - assertEquals(testCase.expected, solutionFound, - "%s(%d, %s) answer must be: %s".formatted( - "CrushBruteForce.arrayManipulation", - testCase.n, - testCase.queries.toString(), - testCase.expected)); + long solutionFound = CrushBruteForce.arrayManipulation(testCase.n, testCase.queries); + + assertEquals( + testCase.expected, + solutionFound, + "%s(%d, %s) answer must be: %s" + .formatted( + "CrushBruteForce.arrayManipulation", + testCase.n, + testCase.queries.toString(), + testCase.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/CrushTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/CrushTest.java index b193da04..2ed17787 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/CrushTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/CrushTest.java @@ -25,10 +25,9 @@ public static class CrushTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", "hackerrank", - "interview_preparation_kit", - "arrays", - "crush.testcases.json"); + String path = + String.join( + "/", "hackerrank", "interview_preparation_kit", "arrays", "crush.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, CrushTestCase.class)); @@ -37,15 +36,17 @@ void setup() throws IOException { @Test void testArrayManipulation() { for (CrushTestCase testCase : testCases) { - long solutionFound = CrushOptimized - .arrayManipulation(testCase.n, testCase.queries); - - assertEquals(testCase.expected, solutionFound, - "%s(%d, %s) answer must be: %s".formatted( - "CrushOptimized.arrayManipulation", - testCase.n, - testCase.queries.toString(), - testCase.expected)); + long solutionFound = CrushOptimized.arrayManipulation(testCase.n, testCase.queries); + + assertEquals( + testCase.expected, + solutionFound, + "%s(%d, %s) answer must be: %s" + .formatted( + "CrushOptimized.arrayManipulation", + testCase.n, + testCase.queries.toString(), + testCase.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/MinimumSwaps2Test.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/MinimumSwaps2Test.java index c61ab3a2..02b8dc6e 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/MinimumSwaps2Test.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/MinimumSwaps2Test.java @@ -24,10 +24,13 @@ public static class MinimumSwaps2TestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", "hackerrank", - "interview_preparation_kit", - "arrays", - "minimum_swaps_2.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "arrays", + "minimum_swaps_2.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, MinimumSwaps2TestCase.class)); @@ -36,17 +39,15 @@ void setup() throws IOException { @Test void testArrayManipulation() { for (MinimumSwaps2TestCase testCase : testCases) { - int[] input = testCase.input - .stream() - .mapToInt(Integer::intValue) - .toArray(); + int[] input = testCase.input.stream().mapToInt(Integer::intValue).toArray(); long solutionFound = MinimumSwaps2.minimumSwaps(input); - assertEquals(testCase.expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "MinimumSwaps2.minimumSwaps", - testCase.input.toString(), - testCase.expected)); + assertEquals( + testCase.expected, + solutionFound, + "%s(%s) answer must be: %s" + .formatted( + "MinimumSwaps2.minimumSwaps", testCase.input.toString(), testCase.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaosTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaosTest.java index 0b4602d9..cbc94382 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaosTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/NewYearChaosTest.java @@ -25,10 +25,13 @@ public static class NewYearChaosTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", "hackerrank", - "interview_preparation_kit", - "arrays", - "new_year_chaos.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "arrays", + "new_year_chaos.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, NewYearChaosTestCase.class)); @@ -41,12 +44,11 @@ void testMinimumBribesText() { String solutionFound = NewYearChaos.minimumBribesText(test.input); NewYearChaos.minimumBribes(test.input); - assertEquals(test.expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "NewYearChaosTestCase.minimumBribesText", - test.input, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s) answer must be: %s" + .formatted("NewYearChaosTestCase.minimumBribesText", test.input, test.expected)); } } - } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/TwoDarrayTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/TwoDarrayTest.java index 85c827ae..d6687bc8 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/TwoDarrayTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/arrays/TwoDarrayTest.java @@ -24,10 +24,9 @@ public static class TwoDarrayTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", "hackerrank", - "interview_preparation_kit", - "arrays", - "2d_array.testcases.json"); + String path = + String.join( + "/", "hackerrank", "interview_preparation_kit", "arrays", "2d_array.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, TwoDarrayTestCase.class)); @@ -38,11 +37,11 @@ void testHourglassSum() { for (TwoDarrayTestCase testCase : testCases) { long solutionFound = TwoDarray.hourglassSum(testCase.input); - assertEquals(testCase.expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "TwoDarray.hourglassSum", - testCase.input.toString(), - testCase.expected)); + assertEquals( + testCase.expected, + solutionFound, + "%s(%s) answer must be: %s" + .formatted("TwoDarray.hourglassSum", testCase.input.toString(), testCase.expected)); } } @@ -51,20 +50,18 @@ void testHourglassSumEdgeCases() { List> input = null; Integer expected = null; Integer solutionFound = TwoDarray.hourglassSum(null); - assertEquals(expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "TwoDarray.hourglassSum", - input, - expected)); + assertEquals( + expected, + solutionFound, + "%s(%s) answer must be: %s".formatted("TwoDarray.hourglassSum", input, expected)); input = new ArrayList>(); expected = null; solutionFound = TwoDarray.hourglassSum(null); - assertEquals(expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "TwoDarray.hourglassSum", - input, - expected)); + assertEquals( + expected, + solutionFound, + "%s(%s) answer must be: %s".formatted("TwoDarray.hourglassSum", input, expected)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForceTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForceTest.java index bbc25f16..9b6b5465 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForceTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsBruteForceTest.java @@ -11,9 +11,7 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * CountTripletsBruteForceTest. - */ +/** CountTripletsBruteForceTest. */ @TestInstance(Lifecycle.PER_CLASS) class CountTripletsBruteForceTest { public static class CountTripletsBruteForceTestCase { @@ -28,11 +26,13 @@ public static class CountTripletsBruteForceTestCase { @BeforeAll void setup() throws IOException { String path; - path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "count_triplets_1.small.testcases.json"); + path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "count_triplets_1.small.testcases.json"); this.smallTestCases.clear(); this.smallTestCases.addAll(JsonLoader.loadJson(path, CountTripletsBruteForceTestCase.class)); @@ -43,12 +43,15 @@ void testCountTriplets() { for (CountTripletsBruteForceTestCase test : smallTestCases) { Long solutionFound = CountTripletsBruteForce.countTriplets(test.input, test.r); - assertEquals(test.expected, solutionFound, - "%s(%s, %d) answer must be: %d".formatted( - "CountTripletsBruteForce.countTriplets", - test.input.toString(), - test.r, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s, %d) answer must be: %d" + .formatted( + "CountTripletsBruteForce.countTriplets", + test.input.toString(), + test.r, + test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsTest.java index 619ce03e..0c62e2c0 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/CountTripletsTest.java @@ -11,9 +11,7 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * CountTripletsTest. - */ +/** CountTripletsTest. */ @TestInstance(Lifecycle.PER_CLASS) class CountTripletsTest { public static class CountTripletsTestCase { @@ -29,24 +27,27 @@ public static class CountTripletsTestCase { @BeforeAll void setup() throws IOException { String path; - path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "count_triplets_1.small.testcases.json"); + path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "count_triplets_1.small.testcases.json"); this.smallTestCases.clear(); this.smallTestCases.addAll(JsonLoader.loadJson(path, CountTripletsTestCase.class)); - path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "count_triplets_1.big.testcases.json"); + path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "count_triplets_1.big.testcases.json"); this.bigTestCases.clear(); this.bigTestCases.addAll(JsonLoader.loadJson(path, CountTripletsTestCase.class)); - } @Test @@ -54,12 +55,12 @@ void testCountTriplets() { for (CountTripletsTestCase test : smallTestCases) { Long solutionFound = CountTriplets.countTriplets(test.input, test.r); - assertEquals(test.expected, solutionFound, - "%s(%s, %d) answer must be: %d".formatted( - "CountTriplets.countTriplets", - test.input.toString(), - test.r, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s, %d) answer must be: %d" + .formatted( + "CountTriplets.countTriplets", test.input.toString(), test.r, test.expected)); } } @@ -68,12 +69,12 @@ void testCountTripletsBigCases() { for (CountTripletsTestCase test : bigTestCases) { Long solutionFound = CountTriplets.countTriplets(test.input, test.r); - assertEquals(test.expected, solutionFound, - "%s(%s, %d) answer must be: %d".formatted( - "CountTriplets.countTriplets", - test.input.toString(), - test.r, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s, %d) answer must be: %d" + .formatted( + "CountTriplets.countTriplets", test.input.toString(), test.r, test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueriesTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueriesTest.java index d0810b98..1b43b65e 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueriesTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/FrequencyQueriesTest.java @@ -30,36 +30,44 @@ public static class FrequencyQueriesTestCase { @BeforeAll void setup() throws IOException { String path; - path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "frequency_queries.testcases.json"); + path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "frequency_queries.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, FrequencyQueriesTestCase.class)); - path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "frequency_queries.testcase6.json"); + path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "frequency_queries.testcase6.json"); this.testCase6.clear(); this.testCase6.addAll(JsonLoader.loadJson(path, FrequencyQueriesTestCase.class)); - path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "frequency_queries.testcase_border_cases.json"); + path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "frequency_queries.testcase_border_cases.json"); this.testCaseBorderCases.clear(); this.testCaseBorderCases.addAll(JsonLoader.loadJson(path, FrequencyQueriesTestCase.class)); - path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "frequency_queries.testcase_border_case_exception.json"); + path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "frequency_queries.testcase_border_case_exception.json"); this.testCaseBorderCaseException.clear(); this.testCaseBorderCaseException.addAll( JsonLoader.loadJson(path, FrequencyQueriesTestCase.class)); @@ -72,11 +80,11 @@ void testFrequencyQueries() { for (FrequencyQueriesTestCase test : testCases) { solutionFound = FrequencyQueries.freqQuery(test.input); - assertEquals(test.expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "FrequencyQueriesTest.freqQuery", - test.input, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s) answer must be: %s" + .formatted("FrequencyQueriesTest.freqQuery", test.input, test.expected)); } } @@ -88,11 +96,11 @@ void testFrequencyQueriesBigCases() { solutionFound = FrequencyQueries.freqQuery(test.input); - assertEquals(test.expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "FrequencyQueriesTest.freqQuery", - test.input, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s) answer must be: %s" + .formatted("FrequencyQueriesTest.freqQuery", test.input, test.expected)); } } @@ -104,20 +112,23 @@ void testFrequencyQueriesBorderCases() { solutionFound = FrequencyQueries.freqQuery(test.input); - assertEquals(test.expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "FrequencyQueriesTest.freqQuery", - test.input, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s) answer must be: %s" + .formatted("FrequencyQueriesTest.freqQuery", test.input, test.expected)); } } @Test void testFrequencyQueriesBorderCaseException() { for (FrequencyQueriesTestCase test : testCaseBorderCaseException) { - Exception exception = assertThrows(IllegalArgumentException.class, () -> { - FrequencyQueries.freqQuery(test.input); - }); + Exception exception = + assertThrows( + IllegalArgumentException.class, + () -> { + FrequencyQueries.freqQuery(test.input); + }); String expectedMessage = "Operation 4 not supported"; String actualMessage = exception.getMessage(); diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNoteTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNoteTest.java index f0881497..ff70e6dc 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNoteTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/RansomNoteTest.java @@ -25,10 +25,13 @@ public static class RansomNoteTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "ctci_ransom_note.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "ctci_ransom_note.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, RansomNoteTestCase.class)); @@ -39,12 +42,11 @@ void testArrayManipulation() { for (RansomNoteTestCase test : testCases) { String solutionFound = RansomNote.checkMagazine(test.magazine, test.note); - assertEquals(test.expected, solutionFound, - "%s(%s, %s) answer must be: %s".formatted( - "RansomNote.checkMagazine", - test.magazine, - test.note, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s, %s) answer must be: %s" + .formatted("RansomNote.checkMagazine", test.magazine, test.note, test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagramsTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagramsTest.java index b3538fe6..c6278f37 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagramsTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/SherlockAndAnagramsTest.java @@ -15,18 +15,14 @@ * SherlockAndAnagrams. * * @link Problem definition - * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/two-strings.md]] + * [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/two-strings.md]] */ @TestInstance(Lifecycle.PER_CLASS) class SherlockAndAnagramsTest { - /** - * SherlockAndAnagramsTestCase. - */ + /** SherlockAndAnagramsTestCase. */ public static class SherlockAndAnagramsTestCase { - /** - * SherlockAndAnagramsTestCase.TestCase. - */ + /** SherlockAndAnagramsTestCase.TestCase. */ public static class TestCase { public String input; public Integer expected; @@ -39,29 +35,28 @@ public static class TestCase { private final List testCases = new ArrayList<>(); /** - * Sets up the test environment by loading test cases from a JSON file. - * The JSON file is located in the specified path relative to the project - * structure. + * Sets up the test environment by loading test cases from a JSON file. The JSON file is located + * in the specified path relative to the project structure. * * @throws IOException if an error occurs while reading the JSON file. */ @BeforeAll void setup() throws IOException { - String path = String.join("/", "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "sherlock_and_anagrams.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "sherlock_and_anagrams.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, SherlockAndAnagramsTestCase.class)); } - private SherlockAndAnagramsTest() { - } + private SherlockAndAnagramsTest() {} - /** - * sherlockAndAnagrams. - */ + /** sherlockAndAnagrams. */ @Test void testSherlockAndAnagrams() { for (SherlockAndAnagramsTestCase _testCases : this.testCases) { @@ -69,11 +64,11 @@ void testSherlockAndAnagrams() { for (SherlockAndAnagramsTestCase.TestCase test : _testCases.tests) { Integer solutionFound = SherlockAndAnagrams.sherlockAndAnagrams(test.input); - assertEquals(test.expected, solutionFound, - "%s(%s) answer must be: %s".formatted( - "SherlockAndAnagrams.sherlockAndAnagrams", - test.input, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s) answer must be: %s" + .formatted("SherlockAndAnagrams.sherlockAndAnagrams", test.input, test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStringsTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStringsTest.java index 89f7ac64..61b7ca17 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStringsTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/TwoStringsTest.java @@ -11,9 +11,7 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * TwoStringsTest. - */ +/** TwoStringsTest. */ @TestInstance(Lifecycle.PER_CLASS) class TwoStringsTest { public static class TwoStringsTestCase { @@ -27,11 +25,13 @@ public static class TwoStringsTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "dictionaries_and_hashmaps", - "two_strings.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "dictionaries_and_hashmaps", + "two_strings.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, TwoStringsTestCase.class)); @@ -42,12 +42,11 @@ void testTwoStrings() { for (TwoStringsTestCase test : testCases) { String solutionFound = TwoStrings.twoStrings(test.s1, test.s2); - assertEquals(test.expected, solutionFound, - "%s(%s, %s) answer must be: %s".formatted( - "TwoStrings.twoStrings", - test.s1, - test.s2, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%s, %s) answer must be: %s" + .formatted("TwoStrings.twoStrings", test.s1, test.s2, test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/AngryFloristTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/AngryFloristTest.java index db4091b9..e7f0155a 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/AngryFloristTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/AngryFloristTest.java @@ -11,9 +11,7 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * AngryFloristTest. - */ +/** AngryFloristTest. */ @TestInstance(Lifecycle.PER_CLASS) class AngryFloristTest { public static class AngryFloristTestCase { @@ -27,11 +25,13 @@ public static class AngryFloristTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "greedy_algorithms", - "angry_children.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "greedy_algorithms", + "angry_children.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, AngryFloristTestCase.class)); } @@ -41,11 +41,11 @@ void testAngryFlorist() { for (AngryFloristTestCase test : testCases) { Integer result = AngryFlorist.maxMin(test.k, test.arr); - assertEquals(test.expected, result, - "%s(%s) => must be: %d".formatted( - "AngryFlorist.maxMin", - test.arr.toString(), - test.expected)); + assertEquals( + test.expected, + result, + "%s(%s) => must be: %d" + .formatted("AngryFlorist.maxMin", test.arr.toString(), test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/GreedyFloristTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/GreedyFloristTest.java index e35389cd..a6b6ec11 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/GreedyFloristTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/GreedyFloristTest.java @@ -11,9 +11,7 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * GreedyFloristTest. - */ +/** GreedyFloristTest. */ @TestInstance(Lifecycle.PER_CLASS) class GreedyFloristTest { public static class GreedyFloristTestCase { @@ -27,11 +25,13 @@ public static class GreedyFloristTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "greedy_algorithms", - "greedy_florist.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "greedy_algorithms", + "greedy_florist.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, GreedyFloristTestCase.class)); } @@ -42,11 +42,11 @@ void testGreedyFlorist() { int[] inputArray = test.c.stream().mapToInt(Integer::intValue).toArray(); Integer result = GreedyFlorist.getMinimumCost(test.k, inputArray); - assertEquals(test.expected, result, - "%s(%s) => must be: %d".formatted( - "GreedyFlorist.getMinimumCost", - test.c.toString(), - test.expected)); + assertEquals( + test.expected, + result, + "%s(%s) => must be: %d" + .formatted("GreedyFlorist.getMinimumCost", test.c.toString(), test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalanceTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalanceTest.java index 301fd0da..ede40718 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalanceTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/LuckBalanceTest.java @@ -11,9 +11,7 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * LuckBalanceTest. - */ +/** LuckBalanceTest. */ @TestInstance(Lifecycle.PER_CLASS) class LuckBalanceTest { public static class LuckBalanceTestCase { @@ -27,11 +25,13 @@ public static class LuckBalanceTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "greedy_algorithms", - "luck_balance.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "greedy_algorithms", + "luck_balance.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, LuckBalanceTestCase.class)); @@ -42,12 +42,11 @@ void testLuckBalance() { for (LuckBalanceTestCase test : testCases) { Integer result = LuckBalance.luckBalance(test.k, test.contests); - assertEquals(test.expected, result, - "%s(%d, %s) => must be: %s".formatted( - "LuckBalance.luckBalance", - test.k, - test.contests, - test.expected)); + assertEquals( + test.expected, + result, + "%s(%d, %s) => must be: %s" + .formatted("LuckBalance.luckBalance", test.k, test.contests, test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArrayTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArrayTest.java index acaba0c9..2bf6703c 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArrayTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/greedy_algorithms/MinimumAbsoluteDifferenceInAnArrayTest.java @@ -11,9 +11,7 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * MinimumAbsoluteDifferenceInAnArrayTest. - */ +/** MinimumAbsoluteDifferenceInAnArrayTest. */ @TestInstance(Lifecycle.PER_CLASS) class MinimumAbsoluteDifferenceInAnArrayTest { public static class MinimumAbsoluteDifferenceInAnArrayTestCase { @@ -26,11 +24,13 @@ public static class MinimumAbsoluteDifferenceInAnArrayTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "greedy_algorithms", - "minimum_absolute_difference_in_an_array.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "greedy_algorithms", + "minimum_absolute_difference_in_an_array.testcases.json"); this.testCases.clear(); this.testCases.addAll( JsonLoader.loadJson(path, MinimumAbsoluteDifferenceInAnArrayTestCase.class)); @@ -41,11 +41,14 @@ void testMinimumAbsoluteDifferenceInAnArray() { for (MinimumAbsoluteDifferenceInAnArrayTestCase test : testCases) { Integer result = MinimumAbsoluteDifferenceInAnArray.minimumAbsoluteDifference(test.input); - assertEquals(test.expected, result, - "%s(%s) => must be: %d".formatted( - "MinimumAbsoluteDifferenceInAnArray.minimumAbsoluteDifference", - test.input.toString(), - test.expected)); + assertEquals( + test.expected, + result, + "%s(%s) => must be: %d" + .formatted( + "MinimumAbsoluteDifferenceInAnArray.minimumAbsoluteDifference", + test.input.toString(), + test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsAlternativeTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsAlternativeTest.java index 89d750fc..73639f35 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsAlternativeTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsAlternativeTest.java @@ -11,22 +11,16 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * FlippingBitsTflippingBits. - */ +/** FlippingBitsTflippingBits. */ @TestInstance(Lifecycle.PER_CLASS) class FlippingBitsAlternativeTest { - /** - * FlippingBitsAlternativeTestCaseTest. - */ + /** FlippingBitsAlternativeTestCaseTest. */ public static class FlippingBitsAlternativeTestCaseTest { public long input; public long answer; } - /** - * FlippingBitsAlternativeTestCase. - */ + /** FlippingBitsAlternativeTestCase. */ public static class FlippingBitsAlternativeTestCase { public String title; public List tests; @@ -36,11 +30,13 @@ public static class FlippingBitsAlternativeTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "miscellaneous", - "flipping_bits.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "miscellaneous", + "flipping_bits.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, FlippingBitsAlternativeTestCase.class)); @@ -52,11 +48,11 @@ void testFlippingBitsAlternative() { for (FlippingBitsAlternativeTestCaseTest test : tests.tests) { Long result = FlippingBitsAlternative.flippingBits(test.input); - assertEquals(test.answer, result, - "%s(%s) => must be: %d".formatted( - "FlippingBits.flippingBits", - test.input, - test.answer)); + assertEquals( + test.answer, + result, + "%s(%s) => must be: %d" + .formatted("FlippingBits.flippingBits", test.input, test.answer)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsTest.java index fd2aca28..25f35dee 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/FlippingBitsTest.java @@ -11,22 +11,16 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * FlippingBitsTflippingBits. - */ +/** FlippingBitsTflippingBits. */ @TestInstance(Lifecycle.PER_CLASS) class FlippingBitsTest { - /** - * FlippingBitsTestCaseTest. - */ + /** FlippingBitsTestCaseTest. */ public static class FlippingBitsTestCaseTest { public long input; public long answer; } - /** - * FlippingBitsTestCase. - */ + /** FlippingBitsTestCase. */ public static class FlippingBitsTestCase { public String title; public List tests; @@ -36,11 +30,13 @@ public static class FlippingBitsTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "miscellaneous", - "flipping_bits.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "miscellaneous", + "flipping_bits.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, FlippingBitsTestCase.class)); @@ -52,11 +48,11 @@ void testFlippingBits() { for (FlippingBitsTestCaseTest test : tests.tests) { Long result = FlippingBits.flippingBits(test.input); - assertEquals(test.answer, result, - "%s(%s) => must be: %d".formatted( - "FlippingBits.flippingBits", - test.input, - test.answer)); + assertEquals( + test.answer, + result, + "%s(%s) => must be: %d" + .formatted("FlippingBits.flippingBits", test.input, test.answer)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/TimeComplexityPrimalityTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/TimeComplexityPrimalityTest.java index 4671c19c..a5a6fe55 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/TimeComplexityPrimalityTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/interview_preparation_kit/miscellaneous/TimeComplexityPrimalityTest.java @@ -11,22 +11,16 @@ import org.junit.jupiter.api.TestInstance.Lifecycle; import util.JsonLoader; -/** - * TimeComplexityPrimalityTest. - */ +/** TimeComplexityPrimalityTest. */ @TestInstance(Lifecycle.PER_CLASS) class TimeComplexityPrimalityTest { - /** - * TimeComplexityPrimalityTestCaseTest. - */ + /** TimeComplexityPrimalityTestCaseTest. */ public static class TimeComplexityPrimalityTestCaseTest { public int input; public String answer; } - /** - * TimeComplexityPrimalityTestCase. - */ + /** TimeComplexityPrimalityTestCase. */ public static class TimeComplexityPrimalityTestCase { public String title; public List tests; @@ -36,11 +30,13 @@ public static class TimeComplexityPrimalityTestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "interview_preparation_kit", - "miscellaneous", - "ctci_big_o.testcases.json"); + String path = + String.join( + "/", + "hackerrank", + "interview_preparation_kit", + "miscellaneous", + "ctci_big_o.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, TimeComplexityPrimalityTestCase.class)); @@ -52,11 +48,11 @@ void testTimeComplexityPrimality() { for (TimeComplexityPrimalityTestCaseTest test : tests.tests) { String result = TimeComplexityPrimality.primality(test.input); - assertEquals(test.answer, result, - "%s(%s) => must be: %s".formatted( - "TimeComplexityPrimality.primality", - test.input, - test.answer)); + assertEquals( + test.answer, + result, + "%s(%s) => must be: %s" + .formatted("TimeComplexityPrimality.primality", test.input, test.answer)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler001Test.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler001Test.java index ab677560..51ccd89c 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler001Test.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler001Test.java @@ -25,10 +25,7 @@ public static class Euler001TestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "projecteuler", - "euler001.testcases.json"); + String path = String.join("/", "hackerrank", "projecteuler", "euler001.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, Euler001TestCase.class)); @@ -40,11 +37,11 @@ void euler001() { for (Euler001TestCase test : testCases) { Long solutionFound = Euler001.euler001(test.a, test.b, test.n); - assertEquals(test.expected, solutionFound, - "%s(%d, %d, %d) => must be: %s".formatted( - "Euler001.euler001", - test.a, test.b, test.n, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%d, %d, %d) => must be: %s" + .formatted("Euler001.euler001", test.a, test.b, test.n, test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler002Test.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler002Test.java index 9e1e40ae..ad79bf14 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler002Test.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler002Test.java @@ -23,10 +23,7 @@ public static class Euler002TestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "projecteuler", - "euler002.testcases.json"); + String path = String.join("/", "hackerrank", "projecteuler", "euler002.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, Euler002TestCase.class)); @@ -38,11 +35,10 @@ void euler002() { for (Euler002TestCase test : testCases) { Long solutionFound = Euler002.euler002(test.n); - assertEquals(test.expected, solutionFound, - "%s(%d) => must be: %s".formatted( - "Euler002.euler002", - test.n, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%d) => must be: %s".formatted("Euler002.euler002", test.n, test.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler003Test.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler003Test.java index 2b4776dc..8db37d32 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler003Test.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/projecteuler/Euler003Test.java @@ -27,10 +27,7 @@ public static class Euler003TestCase { @BeforeAll void setup() throws IOException { - String path = String.join("/", - "hackerrank", - "projecteuler", - "euler003.testcases.json"); + String path = String.join("/", "hackerrank", "projecteuler", "euler003.testcases.json"); this.testCases.clear(); this.testCases.addAll(JsonLoader.loadJson(path, Euler003TestCase.class)); @@ -42,19 +39,15 @@ void euler003() { for (Euler003TestCase test : testCases) { Long solutionFound = Euler003.euler003(test.n); - assertEquals(test.expected, solutionFound, - "%s(%d) => must be: %s".formatted( - "Euler003.euler003", - test.n, - test.expected)); + assertEquals( + test.expected, + solutionFound, + "%s(%d) => must be: %s".formatted("Euler003.euler003", test.n, test.expected)); } } @ParameterizedTest - @CsvSource({ - "0", - "1" - }) + @CsvSource({"0", "1"}) void euler003edgecases(long input) { Exception exception; @@ -64,6 +57,5 @@ void euler003edgecases(long input) { String expectedMessage = "n must be greater than 2"; assertTrue(exception.getMessage().contains(expectedMessage)); - } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/BirthdayCakeCandlesTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/BirthdayCakeCandlesTest.java index b6bb68e6..e60999bd 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/BirthdayCakeCandlesTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/BirthdayCakeCandlesTest.java @@ -29,12 +29,8 @@ public BirthdayCakeCandlesTestCase(List candles, Integer expected) { @BeforeAll void setup() { this.testCases.clear(); - this.testCases.add(new BirthdayCakeCandlesTestCase( - Arrays.asList(3, 2, 1, 3), - 2)); - this.testCases.add(new BirthdayCakeCandlesTestCase( - Arrays.asList(1, 2, 3, 3), - 2)); + this.testCases.add(new BirthdayCakeCandlesTestCase(Arrays.asList(3, 2, 1, 3), 2)); + this.testCases.add(new BirthdayCakeCandlesTestCase(Arrays.asList(1, 2, 3, 3), 2)); } @Test @@ -42,20 +38,24 @@ void birthdayCakeCandles() { for (BirthdayCakeCandlesTestCase testCase : this.testCases) { Integer solutionFound = BirthdayCakeCandles.birthdayCakeCandles(testCase.candles); - assertEquals(testCase.expected, solutionFound, - String.format("%s(%s) answer must be: %d", - "CompareTriplets.compareTriplets", - testCase.candles.toString(), - testCase.expected)); + assertEquals( + testCase.expected, + solutionFound, + String.format( + "%s(%s) answer must be: %d", + "CompareTriplets.compareTriplets", testCase.candles.toString(), testCase.expected)); } } @Test void testMiniMaxSumNullInput() { - IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> { - BirthdayCakeCandles.birthdayCakeCandles(null); - }); + IllegalArgumentException exception = + assertThrows( + IllegalArgumentException.class, + () -> { + BirthdayCakeCandles.birthdayCakeCandles(null); + }); String expectedMessage = "Parameter cannot be empty"; String actualMessage = exception.getMessage(); @@ -67,9 +67,12 @@ void testMiniMaxSumNullInput() { void testMiniMaxSumEmptyInput() { List input = Arrays.asList(); - IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> { - BirthdayCakeCandles.birthdayCakeCandles(input); - }); + IllegalArgumentException exception = + assertThrows( + IllegalArgumentException.class, + () -> { + BirthdayCakeCandles.birthdayCakeCandles(input); + }); String expectedMessage = "Parameter cannot be empty"; String actualMessage = exception.getMessage(); diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/CompareTripletsTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/CompareTripletsTest.java index ae3b13c4..225d543a 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/CompareTripletsTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/CompareTripletsTest.java @@ -30,10 +30,9 @@ public CompareTripletsTestCase(List la, List lb, List @BeforeAll void setup() { this.testCases.clear(); - this.testCases.add(new CompareTripletsTestCase( - Arrays.asList(5, 6, 7), - Arrays.asList(3, 6, 10), - Arrays.asList(1, 1))); + this.testCases.add( + new CompareTripletsTestCase( + Arrays.asList(5, 6, 7), Arrays.asList(3, 6, 10), Arrays.asList(1, 1))); } @Test @@ -41,8 +40,11 @@ void testCompareTriplets() { for (CompareTripletsTestCase testCase : this.testCases) { List solutionFound = CompareTriplets.compareTriplets(testCase.la, testCase.lb); - assertEquals(testCase.expected, solutionFound, - String.format("%s(%s, %s) answer must be: %s", + assertEquals( + testCase.expected, + solutionFound, + String.format( + "%s(%s, %s) answer must be: %s", "CompareTriplets.compareTriplets", testCase.la.toString(), testCase.lb.toString(), diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/DiagonalDifferenceTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/DiagonalDifferenceTest.java index f86efa8d..89252f61 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/DiagonalDifferenceTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/DiagonalDifferenceTest.java @@ -28,10 +28,11 @@ public DiagonalDifferenceTestCase(List> input, int expected) { @BeforeAll void setup() { this.testCases.clear(); - this.testCases.add(new DiagonalDifferenceTestCase(Arrays.asList( - Arrays.asList(11, 2, 4), - Arrays.asList(4, 5, 6), - Arrays.asList(10, 8, -12)), 15)); + this.testCases.add( + new DiagonalDifferenceTestCase( + Arrays.asList( + Arrays.asList(11, 2, 4), Arrays.asList(4, 5, 6), Arrays.asList(10, 8, -12)), + 15)); } @Test @@ -40,11 +41,12 @@ void testDiagonalDifference() { for (DiagonalDifferenceTestCase testCase : this.testCases) { Integer resultFound = DiagonalDifference.diagonalDifference(testCase.matrix); - assertEquals(testCase.expected, resultFound, - String.format("%s(%s) answer must be: %s", - "MiniMaxSum.miniMaxSum", - testCase.matrix.toString(), - testCase.expected.toString())); + assertEquals( + testCase.expected, + resultFound, + String.format( + "%s(%s) answer must be: %s", + "MiniMaxSum.miniMaxSum", testCase.matrix.toString(), testCase.expected.toString())); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/MiniMaxSumTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/MiniMaxSumTest.java index ba31e9a6..52489f43 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/MiniMaxSumTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/MiniMaxSumTest.java @@ -40,20 +40,24 @@ void testMiniMaxSum() { for (MiniMaxSumTestCase testCase : this.testCases) { String solutionFound = MiniMaxSum.miniMaxSum(testCase.input); - assertEquals(testCase.expected, solutionFound, - String.format("%s(%s) answer must be: %s", - "MiniMaxSum.miniMaxSum", - testCase.input.toString(), - testCase.expected)); + assertEquals( + testCase.expected, + solutionFound, + String.format( + "%s(%s) answer must be: %s", + "MiniMaxSum.miniMaxSum", testCase.input.toString(), testCase.expected)); } } @Test void testMiniMaxSumNullInput() { - IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> { - MiniMaxSum.miniMaxSum(null); - }); + IllegalArgumentException exception = + assertThrows( + IllegalArgumentException.class, + () -> { + MiniMaxSum.miniMaxSum(null); + }); String expectedMessage = "Parameter cannot be empty"; String actualMessage = exception.getMessage(); @@ -65,9 +69,12 @@ void testMiniMaxSumNullInput() { void testMiniMaxSumEmptyInput() { List input = Arrays.asList(); - IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> { - MiniMaxSum.miniMaxSum(input); - }); + IllegalArgumentException exception = + assertThrows( + IllegalArgumentException.class, + () -> { + MiniMaxSum.miniMaxSum(input); + }); String expectedMessage = "Parameter cannot be empty"; String actualMessage = exception.getMessage(); diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/PlusMinusTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/PlusMinusTest.java index bd172d5f..2e6199b5 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/PlusMinusTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/PlusMinusTest.java @@ -31,7 +31,6 @@ void setup() { new PlusMinusTestCase( Arrays.asList(-4, 3, -9, 0, 4, 1), String.join("\n", "0.500000", "0.333333", "0.166667"))); - } @Test @@ -40,11 +39,12 @@ void testPlusMinus() { for (PlusMinusTestCase testCase : this.testCases) { String solutionFound = PlusMinus.plusMinus(testCase.input); - assertEquals(testCase.expected, solutionFound, - String.format("%s(%s) answer must be: %s", - "PlusMinus.plusMinus", - testCase.input.toString(), - testCase.toString())); + assertEquals( + testCase.expected, + solutionFound, + String.format( + "%s(%s) answer must be: %s", + "PlusMinus.plusMinus", testCase.input.toString(), testCase.toString())); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/SimpleArraySumTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/SimpleArraySumTest.java index 9ba863ea..f50727dc 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/SimpleArraySumTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/SimpleArraySumTest.java @@ -6,21 +6,20 @@ import java.util.List; import org.junit.jupiter.api.Test; - class SimpleArraySumTest { - @Test void testSimpleArraySum() { + @Test + void testSimpleArraySum() { Integer answer = 5; List ar = Arrays.asList(2, 3); Integer solutionFound = SimpleArraySum.simpleArraySum(ar); - assertEquals(answer, solutionFound, - String.format("%s(%s) answer must be: %d", - "SimpleArraySum.simpleArraySum", - ar.toString(), - answer) - ); + assertEquals( + answer, + solutionFound, + String.format( + "%s(%s) answer must be: %d", "SimpleArraySum.simpleArraySum", ar.toString(), answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/SolveMeFirstTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/SolveMeFirstTest.java index c8476a47..6385dddc 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/SolveMeFirstTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/SolveMeFirstTest.java @@ -4,10 +4,10 @@ import org.junit.jupiter.api.Test; - class SolveMeFirstTest { - @Test void solveMeFirst() { + @Test + void solveMeFirst() { Integer answer = 5; Integer a = 2; @@ -15,8 +15,9 @@ class SolveMeFirstTest { Integer solutionFound = SolveMeFirst.solveMeFirst(a, b); - assertEquals(answer, solutionFound, - String.format("%s(%d, %d) answer must be: %d", "SolveMeFirst.solveMeFirst", a, b, answer) - ); + assertEquals( + answer, + solutionFound, + String.format("%s(%d, %d) answer must be: %d", "SolveMeFirst.solveMeFirst", a, b, answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/StaircaseTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/StaircaseTest.java index de937e46..0077f25d 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/StaircaseTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/StaircaseTest.java @@ -27,13 +27,7 @@ void setup() { this.testCases.clear(); this.testCases.add( new StaircaseTestCase( - 6, String.join("\n", - " #", - " ##", - " ###", - " ####", - " #####", - "######"))); + 6, String.join("\n", " #", " ##", " ###", " ####", " #####", "######"))); } @Test @@ -41,11 +35,12 @@ void testStaircase() { for (StaircaseTestCase testCase : this.testCases) { String solutionFound = Staircase.staircase(testCase.input); - assertEquals(testCase.expected, solutionFound, - String.format("%s(%d) answer must be: %s", - "Staircase.staircase", - testCase.input, - testCase.expected)); + assertEquals( + testCase.expected, + solutionFound, + String.format( + "%s(%d) answer must be: %s", + "Staircase.staircase", testCase.input, testCase.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/TimeConversionTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/TimeConversionTest.java index 73353e0a..64bb0b51 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/TimeConversionTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/TimeConversionTest.java @@ -35,11 +35,12 @@ void testStaircase() { for (TimeConversionTestCase testCase : this.testCases) { String solutionFound = TimeConversion.timeConversion(testCase.input); - assertEquals(testCase.expected, solutionFound, - String.format("%s(%s) answer must be: %s", - "Staircase.staircase", - testCase.input, - testCase.expected)); + assertEquals( + testCase.expected, + solutionFound, + String.format( + "%s(%s) answer must be: %s", + "Staircase.staircase", testCase.input, testCase.expected)); } } } diff --git a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/VeryBigSumTest.java b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/VeryBigSumTest.java index 57d64972..e3cb8408 100644 --- a/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/VeryBigSumTest.java +++ b/algorithm-exercises-java/src/test/java/ae/hackerrank/warmup/VeryBigSumTest.java @@ -6,18 +6,20 @@ import java.util.List; import org.junit.jupiter.api.Test; - class VeryBigSumTest { - @Test void test_aVeryBigSum() { + @Test + void test_aVeryBigSum() { Long answer = 5000000015L; List arr = Arrays.asList(1000000001L, 1000000002L, 1000000003L, 1000000004L, 1000000005L); Long solutionFound = VeryBigSum.aVeryBigSum(arr); - assertEquals(answer, solutionFound, - String.format("%s(%s) answer must be: %d", "VeryBigSum.aVeryBigSum", arr.toString(), answer) - ); + assertEquals( + answer, + solutionFound, + String.format( + "%s(%s) answer must be: %d", "VeryBigSum.aVeryBigSum", arr.toString(), answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0001Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0001Test.java index 1c2746c1..182e5cf3 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0001Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0001Test.java @@ -4,17 +4,15 @@ import org.junit.jupiter.api.Test; - class Problem0001Test { - @Test void problem0001() { + @Test + void problem0001() { Integer solutionFound = 233168; Integer top = 1000; Integer answer = Problem0001.problem0001(top); - assertEquals(answer, solutionFound, - String.format("Problem 00011 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 00011 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0002Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0002Test.java index c1b05d87..92b477df 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0002Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0002Test.java @@ -4,16 +4,14 @@ import org.junit.jupiter.api.Test; - class Problem0002Test { - @Test void problem0002() { + @Test + void problem0002() { int answer = 4613732; int top = 4000000; int solutionFound = Problem0002.problem0002(top); - assertEquals(answer, solutionFound, - String.format("Problem 00002 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 00002 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0003Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0003Test.java index d0242a6d..839a0f2a 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0003Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0003Test.java @@ -4,41 +4,37 @@ import org.junit.jupiter.api.Test; - class Problem0003Test { private static final String OUTPUT_MESSAGE = "Problem 0003 answer must be: %d"; - @Test void problem0003BorderCaseTest() { + @Test + void problem0003BorderCaseTest() { Long answer = null; Long top = 1L; Long solutionFound = Problem0003.problem0003(top); - assertEquals(answer, solutionFound, - String.format(OUTPUT_MESSAGE, answer) - ); + assertEquals(answer, solutionFound, String.format(OUTPUT_MESSAGE, answer)); } - @Test void problem0003ShortCaseTest() { + @Test + void problem0003ShortCaseTest() { Long answer = 2L; Long top = 16L; Long solutionFound = Problem0003.problem0003(top); - assertEquals(answer, solutionFound, - String.format(OUTPUT_MESSAGE, answer) - ); + assertEquals(answer, solutionFound, String.format(OUTPUT_MESSAGE, answer)); } - @Test void problem0003FulltCaseTest() { + @Test + void problem0003FulltCaseTest() { Long answer = 6857L; Long top = 600851475143L; Long solutionFound = Problem0003.problem0003(top); - assertEquals(answer, solutionFound, - String.format(OUTPUT_MESSAGE, answer) - ); + assertEquals(answer, solutionFound, String.format(OUTPUT_MESSAGE, answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0004Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0004Test.java index 4525c6ab..327686c6 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0004Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0004Test.java @@ -4,18 +4,16 @@ import org.junit.jupiter.api.Test; - class Problem0004Test { - @Test void problem0004() { + @Test + void problem0004() { Integer answer = 906609; Integer bottom = 111; Integer top = 999; Integer solutionFound = Problem0004.problem0004(bottom, top); - assertEquals(answer, solutionFound, - String.format("Problem 0004 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0004 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0005SimpleTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0005SimpleTest.java index 8bd8fd24..b81556df 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0005SimpleTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0005SimpleTest.java @@ -6,11 +6,10 @@ import org.junit.jupiter.api.condition.EnabledIfEnvironmentVariable; import util.Log; - class Problem0005SimpleTest { - - @Test void problem0005SmallTest() { + @Test + void problem0005SmallTest() { Integer answer = 2520; Integer bottom = 1; @@ -19,13 +18,11 @@ class Problem0005SimpleTest { Integer solutionFound = Problem0005Simple.problem0005(bottom, top, startFrom); - assertEquals(answer, solutionFound, - String.format("Problem 0005 answer must be: %d", answer) - ); - + assertEquals(answer, solutionFound, String.format("Problem 0005 answer must be: %d", answer)); } - @Test void problem0005BruteForceCuttedTest() { + @Test + void problem0005BruteForceCuttedTest() { String log; log = "Problem 00005 BRUTE FORCE stars..."; @@ -37,16 +34,18 @@ class Problem0005SimpleTest { Integer startFrom = answer - 1000; Integer solutionFound = Problem0005Simple.problem0005(bottom, top, startFrom); - assertEquals(answer, solutionFound, - String.format("Problem 0005 BRUTE-FORCE answer must be: %d", answer) - ); + assertEquals( + answer, + solutionFound, + String.format("Problem 0005 BRUTE-FORCE answer must be: %d", answer)); log = "Problem 00005 BRUTE FORCE ends."; Log.info(log); } @EnabledIfEnvironmentVariable(named = "BRUTEFORCE", matches = "TRUE") - @Test void problem0005BruteForceFull() { + @Test + void problem0005BruteForceFull() { String log; log = "Problem 00005 BRUTE FORCE stars..."; @@ -58,9 +57,10 @@ class Problem0005SimpleTest { Integer startFrom = 1; Integer solutionFound = Problem0005Simple.problem0005(bottom, top, startFrom); - assertEquals(answer, solutionFound, - String.format("Problem 0005 BRUTE-FORCE answer must be: %d", answer) - ); + assertEquals( + answer, + solutionFound, + String.format("Problem 0005 BRUTE-FORCE answer must be: %d", answer)); log = "Problem 00005 BRUTE FORCE ends."; Log.info(log); diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0005Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0005Test.java index 25236b17..217d6ab7 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0005Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0005Test.java @@ -6,25 +6,22 @@ import org.junit.jupiter.api.condition.EnabledIfEnvironmentVariable; import util.Log; - class Problem0005Test { - - @Test void problem0005() { + @Test + void problem0005() { Integer answer = 2520; Integer bottom = 1; Integer top = 10; Integer solutionFound = Problem0005.problem0005(bottom, top); - assertEquals(answer, solutionFound, - String.format("Problem 0005 answer must be: %d", answer) - ); - + assertEquals(answer, solutionFound, String.format("Problem 0005 answer must be: %d", answer)); } @EnabledIfEnvironmentVariable(named = "BRUTEFORCE", matches = "TRUE") - @Test void problem0005BruteForce() { + @Test + void problem0005BruteForce() { String log; log = "Problem 00005 BRUTE FORCE stars..."; @@ -36,9 +33,7 @@ class Problem0005Test { Integer solutionFound = Problem0005.problem0005(bottom, top); log = String.format("Problem 0005 BRUTE-FORCE answer must be: %s", answer); - assertEquals(answer, solutionFound, - log - ); + assertEquals(answer, solutionFound, log); log = "Problem 0005 BRUTE FORCE ends."; Log.info(log); diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0006Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0006Test.java index 3d41e7e8..bfdff218 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0006Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0006Test.java @@ -6,7 +6,8 @@ class Problem0006Test { - @Test void problem0006() { + @Test + void problem0006() { Integer bottom = 1; Integer top = 100; @@ -14,9 +15,9 @@ class Problem0006Test { Integer expectedSolution = 25164150; Integer calculated = Problem0006.problem0006(bottom, top); - - assertEquals(expectedSolution, calculated, - String.format("Problem 0006 answer must be: %d", expectedSolution) - ); + assertEquals( + expectedSolution, + calculated, + String.format("Problem 0006 answer must be: %d", expectedSolution)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0007Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0007Test.java index b63d01f5..e9f2273a 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0007Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0007Test.java @@ -5,28 +5,31 @@ import org.junit.jupiter.api.Test; import org.junit.jupiter.api.condition.EnabledIfEnvironmentVariable; - class Problem0007Test { - @Test void problem0007SmallTest() { + @Test + void problem0007SmallTest() { Integer expectedSolution = 13; Integer top = 6; Integer solutionFound = Problem0007.problem0007(top); - assertEquals(expectedSolution, solutionFound, - String.format("Problem 0007 answer must be: %d", expectedSolution) - ); + assertEquals( + expectedSolution, + solutionFound, + String.format("Problem 0007 answer must be: %d", expectedSolution)); } @EnabledIfEnvironmentVariable(named = "BRUTEFORCE", matches = "TRUE") - @Test void problem0007FullTest() { + @Test + void problem0007FullTest() { Integer expectedSolution = 104743; Integer top = 10001; Integer solutionFound = Problem0007.problem0007(top); - assertEquals(expectedSolution, solutionFound, - String.format("Problem 0007 answer must be: %d", expectedSolution) - ); + assertEquals( + expectedSolution, + solutionFound, + String.format("Problem 0007 answer must be: %d", expectedSolution)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0008Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0008Test.java index bf230661..9db393f8 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0008Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0008Test.java @@ -7,7 +7,6 @@ import org.junit.jupiter.api.TestInstance; import org.junit.jupiter.api.TestInstance.Lifecycle; - @TestInstance(Lifecycle.PER_CLASS) class Problem0008Test { @@ -16,45 +15,49 @@ class Problem0008Test { @BeforeAll void initNextPrimeFactorOfNumberTestCases() { this.inputNumber = - "73167176531330624919225119674426574742355349194934" - + "96983520312774506326239578318016984801869478851843" - + "85861560789112949495459501737958331952853208805511" - + "12540698747158523863050715693290963295227443043557" - + "66896648950445244523161731856403098711121722383113" - + "62229893423380308135336276614282806444486645238749" - + "30358907296290491560440772390713810515859307960866" - + "70172427121883998797908792274921901699720888093776" - + "65727333001053367881220235421809751254540594752243" - + "52584907711670556013604839586446706324415722155397" - + "53697817977846174064955149290862569321978468622482" - + "83972241375657056057490261407972968652414535100474" - + "82166370484403199890008895243450658541227588666881" - + "16427171479924442928230863465674813919123162824586" - + "17866458359124566529476545682848912883142607690042" - + "24219022671055626321111109370544217506941658960408" - + "07198403850962455444362981230987879927244284909188" - + "84580156166097919133875499200524063689912560717606" - + "05886116467109405077541002256983155200055935729725" - + "71636269561882670428252483600823257530420752963450"; + "73167176531330624919225119674426574742355349194934" + + "96983520312774506326239578318016984801869478851843" + + "85861560789112949495459501737958331952853208805511" + + "12540698747158523863050715693290963295227443043557" + + "66896648950445244523161731856403098711121722383113" + + "62229893423380308135336276614282806444486645238749" + + "30358907296290491560440772390713810515859307960866" + + "70172427121883998797908792274921901699720888093776" + + "65727333001053367881220235421809751254540594752243" + + "52584907711670556013604839586446706324415722155397" + + "53697817977846174064955149290862569321978468622482" + + "83972241375657056057490261407972968652414535100474" + + "82166370484403199890008895243450658541227588666881" + + "16427171479924442928230863465674813919123162824586" + + "17866458359124566529476545682848912883142607690042" + + "24219022671055626321111109370544217506941658960408" + + "07198403850962455444362981230987879927244284909188" + + "84580156166097919133875499200524063689912560717606" + + "05886116467109405077541002256983155200055935729725" + + "71636269561882670428252483600823257530420752963450"; } - @Test void problem0008SmallTest() { + @Test + void problem0008SmallTest() { Long expectedAnswer = 5832L; Integer inputInterval = 4; Long solutionFound = Problem0008.problem0008(this.inputNumber, inputInterval); - assertEquals(expectedAnswer, solutionFound, - String.format("Problem 0008 expected must be: %d", expectedAnswer) - ); + assertEquals( + expectedAnswer, + solutionFound, + String.format("Problem 0008 expected must be: %d", expectedAnswer)); } - @Test void problem0008FullTest() { + @Test + void problem0008FullTest() { Long expectedAnswer = 23514624000L; Integer inputInterval = 13; Long solutionFound = Problem0008.problem0008(this.inputNumber, inputInterval); - assertEquals(expectedAnswer, solutionFound, - String.format("Problem 0008 expected must be: %d", expectedAnswer) - ); + assertEquals( + expectedAnswer, + solutionFound, + String.format("Problem 0008 expected must be: %d", expectedAnswer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0009Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0009Test.java index ca2ed727..5305d1cd 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0009Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0009Test.java @@ -4,52 +4,47 @@ import org.junit.jupiter.api.Test; - class Problem0009Test { private static final String OUTPUT_MESSAGE = "Problem 0009 answer must be: %d"; - @Test void problem0009EmptyTest() { + @Test + void problem0009EmptyTest() { Integer expectedSolution = null; Integer inputLimit = 1; Integer solutionFound = Problem0009.problem0009(inputLimit); - assertEquals(expectedSolution, solutionFound, - String.format(OUTPUT_MESSAGE, expectedSolution) - ); + assertEquals(expectedSolution, solutionFound, String.format(OUTPUT_MESSAGE, expectedSolution)); } - @Test void problem0009EdgeTest() { + @Test + void problem0009EdgeTest() { Integer expectedSolution = null; Integer inputLimit = 10; Integer solutionFound = Problem0009.problem0009(inputLimit); - assertEquals(expectedSolution, solutionFound, - String.format(OUTPUT_MESSAGE, expectedSolution) - ); + assertEquals(expectedSolution, solutionFound, String.format(OUTPUT_MESSAGE, expectedSolution)); } - @Test void problem0009BasicTest() { + @Test + void problem0009BasicTest() { Integer expectedSolution = 3 * 4 * 5; Integer inputLimit = 3 + 4 + 5; Integer solutionFound = Problem0009.problem0009(inputLimit); - assertEquals(expectedSolution, solutionFound, - String.format(OUTPUT_MESSAGE, expectedSolution) - ); + assertEquals(expectedSolution, solutionFound, String.format(OUTPUT_MESSAGE, expectedSolution)); } - @Test void problem0009FullTest() { + @Test + void problem0009FullTest() { Integer expectedSolution = 200 * 375 * 425; Integer inputLimit = 200 + 375 + 425; Integer solutionFound = Problem0009.problem0009(inputLimit); - assertEquals(expectedSolution, solutionFound, - String.format(OUTPUT_MESSAGE, expectedSolution) - ); + assertEquals(expectedSolution, solutionFound, String.format(OUTPUT_MESSAGE, expectedSolution)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0010Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0010Test.java index b2beac41..2095be4e 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0010Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0010Test.java @@ -4,17 +4,18 @@ import org.junit.jupiter.api.Test; - class Problem0010Test { - @Test void problem0010SmallTest() { + @Test + void problem0010SmallTest() { Long expectedSolution = 17L; Long bottom = 1L; Long top = 10L; Long solutionFound = Problem0010.problem0010(bottom, top); - assertEquals(expectedSolution, solutionFound, - String.format("Problem 0010 answer must be: %d", expectedSolution) - ); + assertEquals( + expectedSolution, + solutionFound, + String.format("Problem 0010 answer must be: %d", expectedSolution)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0011Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0011Test.java index 430199c9..10aea837 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0011Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0011Test.java @@ -7,10 +7,10 @@ import ae.projecteuler.data.Problem0011Data; import org.junit.jupiter.api.Test; - class Problem0011Test { - @Test void problem0011() throws Exception { + @Test + void problem0011() throws Exception { Integer answer = 70600674; Integer[][] inputMatrix = Problem0011Data.getProblem11Data(); @@ -18,19 +18,17 @@ class Problem0011Test { Integer solutionFound = Problem0011.problem0011(inputMatrix, inputInterval); - assertEquals(answer, solutionFound, - String.format("Problem 0011 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0011 answer must be: %d", answer)); } - @Test void problem0011WrongData() { + @Test + void problem0011WrongData() { Integer[][] inputMatrix = Problem0011Data.getProblem11WrongData(); Integer inputInterval = 0; - Exception exception = assertThrows(Exception.class, () -> - Problem0011.problem0011(inputMatrix, inputInterval) - ); + Exception exception = + assertThrows(Exception.class, () -> Problem0011.problem0011(inputMatrix, inputInterval)); String expectedMessage = "Not a square matrix"; String actualMessage = exception.getMessage(); diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0012Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0012Test.java index 7de3915e..e1b4d639 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0012Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0012Test.java @@ -4,18 +4,19 @@ import org.junit.jupiter.api.Test; - class Problem0012Test { - @Test void problem0012() { + @Test + void problem0012() { Long expectedSolution = (long) 576; Long inputTop = (long) 500; Long solutionFound = Problem0012.problem0012(inputTop); - assertEquals(expectedSolution, solutionFound, - String.format("Problem 0012 answer must be: %d", expectedSolution) - ); + assertEquals( + expectedSolution, + solutionFound, + String.format("Problem 0012 answer must be: %d", expectedSolution)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0013Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0013Test.java index f9c65a38..ab8837a8 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0013Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0013Test.java @@ -5,9 +5,9 @@ import ae.projecteuler.data.Problem0013Data; import org.junit.jupiter.api.Test; - class Problem0013Test { - @Test void problem0013() { + @Test + void problem0013() { String expectedSolution = "5537376230"; Integer firtsDigits = 10; @@ -15,8 +15,9 @@ class Problem0013Test { String solutionFound = Problem0013.problem0013(arrayOfNumbers, firtsDigits); - assertEquals(expectedSolution, solutionFound, - String.format("Problem 0013 answer must be: %s", expectedSolution) - ); + assertEquals( + expectedSolution, + solutionFound, + String.format("Problem 0013 answer must be: %s", expectedSolution)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0014Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0014Test.java index 95f76522..241550c1 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0014Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0014Test.java @@ -6,10 +6,10 @@ import org.junit.jupiter.api.Test; - class Problem0014Test { - @Test void problem0014() throws Exception { + @Test + void problem0014() throws Exception { Long answer = 837799L; Integer inputBottom = 1; @@ -17,19 +17,21 @@ class Problem0014Test { Long solutionFound = Problem0014.problem0014(inputBottom, inputTop); - assertEquals(answer, solutionFound, - String.format("Problem 0014 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0014 answer must be: %d", answer)); } - @Test void problem0014borderCase() { + @Test + void problem0014borderCase() { Integer inputBottom = -1; Integer inputTop = 10; - Exception exception = assertThrows(Exception.class, () -> { - Problem0014.problem0014(inputBottom, inputTop); - }); + Exception exception = + assertThrows( + Exception.class, + () -> { + Problem0014.problem0014(inputBottom, inputTop); + }); String expectedMessage = "bottom must be a positive integer"; String actualMessage = exception.getMessage(); @@ -37,14 +39,18 @@ class Problem0014Test { assertTrue(actualMessage.contains(expectedMessage)); } - @Test void problem0014WrongParameterCase() { + @Test + void problem0014WrongParameterCase() { Integer inputBottom = 10; Integer inputTop = 1; - Exception exception = assertThrows(Exception.class, () -> { - Problem0014.problem0014(inputBottom, inputTop); - }); + Exception exception = + assertThrows( + Exception.class, + () -> { + Problem0014.problem0014(inputBottom, inputTop); + }); String expectedMessage = "top must be and integer, higher than bottom"; String actualMessage = exception.getMessage(); diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0015Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0015Test.java index 02ecb05e..32f7406d 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0015Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0015Test.java @@ -4,34 +4,29 @@ import org.junit.jupiter.api.Test; - class Problem0015Test { - @Test void problem0015() { + @Test + void problem0015() { Integer input = 20; Long answer = 137846528820L; Long solutionFound = Problem0015.problem0015(input); - assertEquals(answer, solutionFound, - String.format("Problem 0015 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0015 answer must be: %d", answer)); } - @Test void problem0015edgeCase() { + @Test + void problem0015edgeCase() { Integer input = 0; Long answer = 0L; Long solutionFound = Problem0015.problem0015(input); - assertEquals(answer, solutionFound, - String.format("Problem 0015 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0015 answer must be: %d", answer)); input = -1; answer = 0L; solutionFound = Problem0015.problem0015(input); - assertEquals(answer, solutionFound, - String.format("Problem 0015 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0015 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0016Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0016Test.java index 1a8e8fe5..b1ca9ef0 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0016Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0016Test.java @@ -4,9 +4,9 @@ import org.junit.jupiter.api.Test; - class Problem0016Test { - @Test void problem0016() { + @Test + void problem0016() { Integer base = 2; Integer exponent = 1000; @@ -14,8 +14,9 @@ class Problem0016Test { String solutionFound = Problem0016.problem0016(base, exponent); - assertEquals(solutionExpected, solutionFound, - String.format("Problem 0016 answer must be: %s", solutionExpected) - ); + assertEquals( + solutionExpected, + solutionFound, + String.format("Problem 0016 answer must be: %s", solutionExpected)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0017Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0017Test.java index b52231d2..4988bdc5 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0017Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0017Test.java @@ -4,16 +4,17 @@ import org.junit.jupiter.api.Test; - class Problem0017Test { - @Test void problem0017() throws Exception { + @Test + void problem0017() throws Exception { Integer answer = 21124; Integer inputInit = 1; Integer inputLast = 1000; - assertEquals(answer, Problem0017.problem0017(inputInit, inputLast), - String.format("Problem 0017 answer must be: %d", answer) - ); + assertEquals( + answer, + Problem0017.problem0017(inputInit, inputLast), + String.format("Problem 0017 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0018Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0018Test.java index 6f1450c4..8037d7ad 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0018Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0018Test.java @@ -5,32 +5,29 @@ import ae.projecteuler.data.Problem0018Data; import org.junit.jupiter.api.Test; - - class Problem0018Test { - @Test void problem0018() { + @Test + void problem0018() { Integer answer = 23; - Integer[][] input = { - {3}, - {7, 4}, - {2, 4, 6}, - {8, 5, 9, 3} - }; - - assertEquals(answer, Problem0018.problem0018(input), - String.format("Problem 0018 answer must be: %d", answer) - ); + Integer[][] input = {{3}, {7, 4}, {2, 4, 6}, {8, 5, 9, 3}}; + + assertEquals( + answer, + Problem0018.problem0018(input), + String.format("Problem 0018 answer must be: %d", answer)); } - @Test void problem0018full() { + @Test + void problem0018full() { Integer answer = 1074; Integer[][] triangle = Problem0018Data.getProblem18Data(); - assertEquals(answer, Problem0018.problem0018(triangle), - String.format("Problem 0018 answer must be: %d", answer) - ); + assertEquals( + answer, + Problem0018.problem0018(triangle), + String.format("Problem 0018 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0019Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0019Test.java index 7466758d..cb185161 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0019Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0019Test.java @@ -4,34 +4,25 @@ import org.junit.jupiter.api.Test; - class Problem0019Test { - @Test void problem0019SmallCase() { + @Test + void problem0019SmallCase() { Integer answer = 2; - Integer solutionFound = Problem0019.problem0019( - ae.projecteuler.constants.Date.SUNDAY, - 1900, - 1901 - ); - - assertEquals(answer, solutionFound, - String.format("Problem 0019 answer must be: %d", answer) - ); + Integer solutionFound = + Problem0019.problem0019(ae.projecteuler.constants.Date.SUNDAY, 1900, 1901); + + assertEquals(answer, solutionFound, String.format("Problem 0019 answer must be: %d", answer)); } - @Test void problem0019FullCase() { + @Test + void problem0019FullCase() { Integer answer = 171; - Integer solutionFound = Problem0019.problem0019( - ae.projecteuler.constants.Date.SUNDAY, - 1901, - 2000 - ); - - assertEquals(answer, solutionFound, - String.format("Problem 0019 answer must be: %d", answer) - ); + Integer solutionFound = + Problem0019.problem0019(ae.projecteuler.constants.Date.SUNDAY, 1901, 2000); + + assertEquals(answer, solutionFound, String.format("Problem 0019 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0020Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0020Test.java index f17a1b0e..64c10a77 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0020Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0020Test.java @@ -6,14 +6,16 @@ import org.junit.jupiter.api.Test; class Problem0020Test { - @Test void problem0020() { + @Test + void problem0020() { Integer inputLimit = 100; BigNum answer = new BigNum("648"); BigNum solutionFound = Problem0020.problem0020(inputLimit); - assertArrayEquals(answer.toArray(), solutionFound.toArray(), - String.format("Problem 0020 answer must be: %s", answer.toString()) - ); + assertArrayEquals( + answer.toArray(), + solutionFound.toArray(), + String.format("Problem 0020 answer must be: %s", answer.toString())); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0021Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0021Test.java index 44f6fef5..2fc9e271 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0021Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0021Test.java @@ -4,18 +4,16 @@ import org.junit.jupiter.api.Test; - class Problem0021Test { - @Test void problem0021() { + @Test + void problem0021() { int inputStart = 1; int inputLimit = 10000; String answer = "31626"; String solutionFound = Problem0021.problem0021(inputStart, inputLimit); - assertEquals(answer, solutionFound, - String.format("Problem 0021 answer must be: %s", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0021 answer must be: %s", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0022Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0022Test.java index 13628742..79bd1ee8 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0022Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0022Test.java @@ -5,16 +5,14 @@ import ae.projecteuler.data.Problem0022Data; import org.junit.jupiter.api.Test; - class Problem0022Test { - @Test void problem0022full() { + @Test + void problem0022full() { Integer answer = 871198282; Integer solutionFound = Problem0022.problem0022(Problem0022Data.getProblem22Data()); - assertEquals(answer, solutionFound, - String.format("Problem 0022 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0022 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0023Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0023Test.java index 538eb263..834c94af 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0023Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0023Test.java @@ -7,18 +7,14 @@ import org.junit.jupiter.params.ParameterizedTest; import org.junit.jupiter.params.provider.CsvSource; - class Problem0023Test { @ParameterizedTest @CsvSource({ - "12, 24, 276, Test Case 1", - "12, 25, 301, Test Case 2", + "12, 24, 276, Test Case 1", + "12, 25, 301, Test Case 2", }) void problem0023smallCase1( - int inputUnderLimit, - int inputSuperLimit, - int answer, - String testCase) { + int inputUnderLimit, int inputSuperLimit, int answer, String testCase) { Integer solutionFound = Problem0023.problem0023(inputUnderLimit, inputSuperLimit); @@ -27,15 +23,14 @@ void problem0023smallCase1( } @EnabledIfEnvironmentVariable(named = "BRUTEFORCE", matches = "TRUE") - @Test void problem0023fullCase() { + @Test + void problem0023fullCase() { Integer answer = 4179871; Integer inputUnderLimit = 12; Integer inputSuperLimit = 28123; Integer solutionFound = Problem0023.problem0023(inputUnderLimit, inputSuperLimit); - assertEquals(answer, solutionFound, - String.format("Problem 0023 answer must be: %d", answer) - ); + assertEquals(answer, solutionFound, String.format("Problem 0023 answer must be: %d", answer)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0024Test.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0024Test.java index 0a1cbe33..f68275b5 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0024Test.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/Problem0024Test.java @@ -6,9 +6,9 @@ import org.junit.jupiter.api.Test; import org.junit.jupiter.api.condition.EnabledIfEnvironmentVariable; - class Problem0024Test { - @Test void problem0024small() { + @Test + void problem0024small() { String strNumber = "HOLA"; String[] arrNumber = {"H", "O", "L", "A"}; @@ -19,22 +19,17 @@ class Problem0024Test { String inputElements = "ABCD"; Integer inputPermutationToFind = 6; - assertEquals( - solutionFound, - Problem0024.problem0024(inputElements, inputPermutationToFind) - ); + assertEquals(solutionFound, Problem0024.problem0024(inputElements, inputPermutationToFind)); } @EnabledIfEnvironmentVariable(named = "BRUTEFORCE", matches = "TRUE") - @Test void problem0024Full() { + @Test + void problem0024Full() { String solutionFound = "2783915460"; String inputElements = "0123456789"; Integer inputPermutationToFind = 1000000; - assertEquals( - solutionFound, - Problem0024.problem0024(inputElements, inputPermutationToFind) - ); + assertEquals(solutionFound, Problem0024.problem0024(inputElements, inputPermutationToFind)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/BigNumTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/BigNumTest.java index c82f50b5..acd98db7 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/BigNumTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/BigNumTest.java @@ -16,41 +16,32 @@ void instanceCaseTest() { assertNotNull(classUnderTest); assertInstanceOf( - BigNum.class, - classUnderTest, - String.format("Must be an instance of %s", BigNum.class)); + BigNum.class, classUnderTest, String.format("Must be an instance of %s", BigNum.class)); } @Test void bigNumInitialiceTest() { BigNum solutionFound; - Integer[] expectedAnswer = { 0 }; + Integer[] expectedAnswer = {0}; // Test Integer input Integer input = 0; solutionFound = new BigNum(input); - assertArrayEquals( - expectedAnswer, - solutionFound.toArray()); + assertArrayEquals(expectedAnswer, solutionFound.toArray()); // Test string input String inputString = "0"; solutionFound = new BigNum(inputString); - assertArrayEquals( - expectedAnswer, - solutionFound.toArray()); + assertArrayEquals(expectedAnswer, solutionFound.toArray()); // Test ArrayList input ArrayList inputList = new ArrayList(Arrays.asList(0)); solutionFound = new BigNum(inputList); - assertArrayEquals( - expectedAnswer, - solutionFound.toArray()); - + assertArrayEquals(expectedAnswer, solutionFound.toArray()); } @Test @@ -62,18 +53,14 @@ void bigNumbigSumTest() { solutionFound = new BigNum(input); solutionFound.bigSum(6); - Integer[] expectedAnswer = { 6 }; + Integer[] expectedAnswer = {6}; - assertArrayEquals( - expectedAnswer, - solutionFound.toArray()); + assertArrayEquals(expectedAnswer, solutionFound.toArray()); BigNum solutionFoundB = new BigNum(input); solutionFoundB.bigSum(solutionFound); - assertArrayEquals( - expectedAnswer, - solutionFoundB.toArray()); + assertArrayEquals(expectedAnswer, solutionFoundB.toArray()); } @Test @@ -85,36 +72,24 @@ void bigMultiplyRowToBigNumTest() { solutionFound = new BigNum(input); solutionFound.bigSum(6); - assertArrayEquals( - new Integer[] { 4 }, - BigNum.bigMultiplyRowToBigNum("2", 2).toArray()); + assertArrayEquals(new Integer[] {4}, BigNum.bigMultiplyRowToBigNum("2", 2).toArray()); - assertArrayEquals( - new Integer[] { 2, 4 }, - BigNum.bigMultiplyRowToBigNum("12", 2).toArray()); + assertArrayEquals(new Integer[] {2, 4}, BigNum.bigMultiplyRowToBigNum("12", 2).toArray()); - assertArrayEquals( - new Integer[] { 4, 8 }, - BigNum.bigMultiplyRowToBigNum("12", 4).toArray()); + assertArrayEquals(new Integer[] {4, 8}, BigNum.bigMultiplyRowToBigNum("12", 4).toArray()); assertArrayEquals( - new Integer[] { 8, 9, 9, 1 }, - BigNum.bigMultiplyRowToBigNum("999", 9).toArray()); + new Integer[] {8, 9, 9, 1}, BigNum.bigMultiplyRowToBigNum("999", 9).toArray()); } @Test void bigMultiplyTest() { - assertArrayEquals( - new BigNum("4").toArray(), - new BigNum("2").bigMultiply("2").toArray()); + assertArrayEquals(new BigNum("4").toArray(), new BigNum("2").bigMultiply("2").toArray()); - assertArrayEquals( - new BigNum("44").toArray(), - new BigNum("2").bigMultiply("22").toArray()); + assertArrayEquals(new BigNum("44").toArray(), new BigNum("2").bigMultiply("22").toArray()); assertArrayEquals( - new BigNum("998001").toArray(), - new BigNum("999").bigMultiply("999").toArray()); + new BigNum("998001").toArray(), new BigNum("999").bigMultiply("999").toArray()); assertArrayEquals( new BigNum("152415787532388367501905199875019052100").toArray(), @@ -124,41 +99,26 @@ void bigMultiplyTest() { @Test void bigPowerTest() { - assertArrayEquals( - new BigNum("4").toArray(), - new BigNum("2").bigPower(2).toArray()); - assertArrayEquals( - new BigNum("16").toArray(), - new BigNum("2").bigPower(4).toArray()); - assertArrayEquals( - new BigNum("32").toArray(), - new BigNum("2").bigPower(5).toArray()); + assertArrayEquals(new BigNum("4").toArray(), new BigNum("2").bigPower(2).toArray()); + assertArrayEquals(new BigNum("16").toArray(), new BigNum("2").bigPower(4).toArray()); + assertArrayEquals(new BigNum("32").toArray(), new BigNum("2").bigPower(5).toArray()); assertArrayEquals( new BigNum( - "10715086071862673209484250490600018105614048117055" - + "33607443750388370351051124936122493198378815695858" - + "12759467291755314682518714528569231404359845775746" - + "98574803934567774824230985421074605062371141877954" - + "18215304647498358194126739876755916554394607706291" - + "4571196477686542167660429831652624386837205668069376") + "10715086071862673209484250490600018105614048117055" + + "33607443750388370351051124936122493198378815695858" + + "12759467291755314682518714528569231404359845775746" + + "98574803934567774824230985421074605062371141877954" + + "18215304647498358194126739876755916554394607706291" + + "4571196477686542167660429831652624386837205668069376") .toArray(), new BigNum("2").bigPower(1000).toArray()); - } @Test void bigFactorialTest() { - assertArrayEquals( - new BigNum("2").toArray(), - BigNum.bigFactorial(2).toArray()); - assertArrayEquals( - new BigNum("6").toArray(), - BigNum.bigFactorial(3).toArray()); - assertArrayEquals( - new BigNum("120").toArray(), - BigNum.bigFactorial(5).toArray()); - assertArrayEquals( - new BigNum("3628800").toArray(), - BigNum.bigFactorial(10).toArray()); + assertArrayEquals(new BigNum("2").toArray(), BigNum.bigFactorial(2).toArray()); + assertArrayEquals(new BigNum("6").toArray(), BigNum.bigFactorial(3).toArray()); + assertArrayEquals(new BigNum("120").toArray(), BigNum.bigFactorial(5).toArray()); + assertArrayEquals(new BigNum("3628800").toArray(), BigNum.bigFactorial(10).toArray()); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/CollatzTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/CollatzTest.java index 78fe2ca1..ab8408da 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/CollatzTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/CollatzTest.java @@ -4,10 +4,10 @@ import org.junit.jupiter.api.Test; - class CollatzTest { - @Test void collatzSequenceFirstTest() { + @Test + void collatzSequenceFirstTest() { // Test static way assertEquals(40, Collatz.collatz((long) 13)); @@ -17,7 +17,8 @@ class CollatzTest { assertEquals(16, Collatz.collatz((long) 5)); } - @Test void collatzSequenceSecondTest() { + @Test + void collatzSequenceSecondTest() { // Test static way assertEquals(8, Collatz.collatz((long) 16)); diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/DivisorsTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/DivisorsTest.java index fc823bcb..cf773240 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/DivisorsTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/DivisorsTest.java @@ -8,7 +8,6 @@ import org.junit.jupiter.api.Test; - class DivisorsTest { private class DivisorsOfNumberTestCase { @@ -23,34 +22,33 @@ private class DivisorsOfNumberTestCase { } } - @Test void instanceCaseTest() { + @Test + void instanceCaseTest() { Divisors classUnderTest = new Divisors(); assertNotNull(classUnderTest); assertInstanceOf( - Divisors.class, - classUnderTest, - String.format("Must be an instance of %s", Divisors.class)); + Divisors.class, classUnderTest, String.format("Must be an instance of %s", Divisors.class)); } - @Test void listOfDivisorsOfNumberBorderCaseTest() { + @Test + void listOfDivisorsOfNumberBorderCaseTest() { - DivisorsOfNumberTestCase[] testCases = { - new DivisorsOfNumberTestCase(1L, new Long[] { 1L }, 0L) - }; + DivisorsOfNumberTestCase[] testCases = {new DivisorsOfNumberTestCase(1L, new Long[] {1L}, 0L)}; for (DivisorsOfNumberTestCase testCase : testCases) { assertArrayEquals(testCase.answer, Divisors.divisors(testCase.input)); } } - @Test void listOfDivisorsOfNumberTest() { + @Test + void listOfDivisorsOfNumberTest() { DivisorsOfNumberTestCase[] testCases = { - new DivisorsOfNumberTestCase(2L, new Long[] { 1L, 2L }, 1L), - new DivisorsOfNumberTestCase(8L, new Long[] { 1L, 2L, 4L, 8L}, 2L), - new DivisorsOfNumberTestCase(9L, new Long[] { 1L, 3L, 9L }, 2L), - new DivisorsOfNumberTestCase(16L, new Long[] { 1L, 2L, 4L, 8L, 16L}, 3L) + new DivisorsOfNumberTestCase(2L, new Long[] {1L, 2L}, 1L), + new DivisorsOfNumberTestCase(8L, new Long[] {1L, 2L, 4L, 8L}, 2L), + new DivisorsOfNumberTestCase(9L, new Long[] {1L, 3L, 9L}, 2L), + new DivisorsOfNumberTestCase(16L, new Long[] {1L, 2L, 4L, 8L, 16L}, 3L) }; for (DivisorsOfNumberTestCase testCase : testCases) { @@ -68,13 +66,15 @@ private class DivisorsOfNumberTestCase { } } - @Test void abundanceTest() { + @Test + void abundanceTest() { assertEquals(Divisors.DivisorsAbundance.DIVISORS_DEFICIENT, Divisors.abundance(10L)); assertEquals(Divisors.DivisorsAbundance.DIVISORS_ABUNDANT, Divisors.abundance(12L)); assertEquals(Divisors.DivisorsAbundance.DIVISORS_PERFECT, Divisors.abundance(28L)); } - @Test void abundanceBorderCasesTest() { + @Test + void abundanceBorderCasesTest() { assertNotEquals(Divisors.DivisorsAbundance.DIVISORS_ABUNDANT, Divisors.abundance(110L)); assertNotEquals(Divisors.DivisorsAbundance.DIVISORS_ABUNDANT, Divisors.abundance(18632L)); } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/NaturalNumberTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/NaturalNumberTest.java index be2c32d3..3d201a03 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/NaturalNumberTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/NaturalNumberTest.java @@ -13,8 +13,6 @@ import org.junit.jupiter.api.TestInstance; import org.junit.jupiter.api.TestInstance.Lifecycle; - - @TestInstance(Lifecycle.PER_CLASS) class NaturalNumberTest { @@ -42,40 +40,41 @@ public class PrimeFactorsOfNumberTestCase { Long[] factors; Integer cycles; - PrimeFactorsOfNumberTestCase( - Integer input, Long[] factors, Integer cycles) { + PrimeFactorsOfNumberTestCase(Integer input, Long[] factors, Integer cycles) { this.input = input; this.factors = factors; this.cycles = cycles; } } - @BeforeAll void initNextPrimeFactorOfNumberTestCases() { - nextPrimeFactorTestCases = new ArrayList(Arrays.asList( - new NextPrimeFactorOfNumberTestCase(1, 1, 1, false, 0), - new NextPrimeFactorOfNumberTestCase(2, 2, 1, true, 1), - new NextPrimeFactorOfNumberTestCase(4, 2, 2, false, 1), - new NextPrimeFactorOfNumberTestCase(9, 3, 3, false, 2), - new NextPrimeFactorOfNumberTestCase(7, 7, 1, true, 6) - )); + nextPrimeFactorTestCases = + new ArrayList( + Arrays.asList( + new NextPrimeFactorOfNumberTestCase(1, 1, 1, false, 0), + new NextPrimeFactorOfNumberTestCase(2, 2, 1, true, 1), + new NextPrimeFactorOfNumberTestCase(4, 2, 2, false, 1), + new NextPrimeFactorOfNumberTestCase(9, 3, 3, false, 2), + new NextPrimeFactorOfNumberTestCase(7, 7, 1, true, 6))); } private List primeFactorsTestCases; @BeforeAll void initPrimeFactorsOfNumberTestCases() { - primeFactorsTestCases = new ArrayList(Arrays.asList( - new PrimeFactorsOfNumberTestCase(1, new Long[]{ 1L }, 0), - new PrimeFactorsOfNumberTestCase(2, new Long[]{ 2L }, 1), - new PrimeFactorsOfNumberTestCase(6, new Long[]{ 2L, 3L }, 3), - new PrimeFactorsOfNumberTestCase(12, new Long[]{ 2L, 2L, 3L }, 4), - new PrimeFactorsOfNumberTestCase(120, new Long[]{ 2L, 2L, 2L, 3L, 5L }, 9) - )); + primeFactorsTestCases = + new ArrayList( + Arrays.asList( + new PrimeFactorsOfNumberTestCase(1, new Long[] {1L}, 0), + new PrimeFactorsOfNumberTestCase(2, new Long[] {2L}, 1), + new PrimeFactorsOfNumberTestCase(6, new Long[] {2L, 3L}, 3), + new PrimeFactorsOfNumberTestCase(12, new Long[] {2L, 2L, 3L}, 4), + new PrimeFactorsOfNumberTestCase(120, new Long[] {2L, 2L, 2L, 3L, 5L}, 9))); } - @Test void instanceCaseTest() { + @Test + void instanceCaseTest() { NaturalNumber classUnderTest = new NaturalNumber(0L); assertNotNull(classUnderTest); @@ -85,7 +84,8 @@ void initPrimeFactorsOfNumberTestCases() { String.format("Must be an instance of %s", NaturalNumber.class)); } - @Test void nextPrimeFactorOfNumberTest() { + @Test + void nextPrimeFactorOfNumberTest() { for (NextPrimeFactorOfNumberTestCase expected : this.nextPrimeFactorTestCases) { @@ -100,24 +100,21 @@ void initPrimeFactorsOfNumberTestCases() { final Long answer_factor = answer.getNextPrimeFactor(); final Long answer_cached_factor = answer.getNextPrimeFactor(); - assertEquals(Long.valueOf(expected.factor), answer_factor, + assertEquals( + Long.valueOf(expected.factor), + answer_factor, String.format( - "NaturalNumber'%d'.getNextPrimeFactor() => %d", - expected.input, - expected.factor - ) - ); - assertEquals(Long.valueOf(expected.factor), answer_cached_factor, + "NaturalNumber'%d'.getNextPrimeFactor() => %d", expected.input, expected.factor)); + assertEquals( + Long.valueOf(expected.factor), + answer_cached_factor, String.format( - "NaturalNumber'%d'.getNextPrimeFactor() => %d", - expected.input, - expected.factor - ) - ); + "NaturalNumber'%d'.getNextPrimeFactor() => %d", expected.input, expected.factor)); } } - @Test void nextDivisorOfNumberTest() { + @Test + void nextDivisorOfNumberTest() { for (NextPrimeFactorOfNumberTestCase expected : this.nextPrimeFactorTestCases) { @@ -127,8 +124,7 @@ void initPrimeFactorsOfNumberTestCases() { assertInstanceOf( NaturalNumber.class, answer, - String.format("Must be an instance of %s", NaturalNumber.class) - ); + String.format("Must be an instance of %s", NaturalNumber.class)); final Long answer_divisor = answer.getNextDivisor(); final Long answer_cached_divisor = answer.getNextDivisor(); @@ -138,7 +134,8 @@ void initPrimeFactorsOfNumberTestCases() { } } - @Test void nextPrimeFactorCyclesTest() { + @Test + void nextPrimeFactorCyclesTest() { for (NextPrimeFactorOfNumberTestCase expected : this.nextPrimeFactorTestCases) { @@ -148,8 +145,7 @@ void initPrimeFactorsOfNumberTestCases() { assertInstanceOf( NaturalNumber.class, answer, - String.format("Must be an instance of %s", NaturalNumber.class) - ); + String.format("Must be an instance of %s", NaturalNumber.class)); final Integer answer_cycles = answer.getNextPrimeFactorCycles(); final Integer answer_cached_cycles = answer.getNextPrimeFactorCycles(); @@ -159,7 +155,8 @@ void initPrimeFactorsOfNumberTestCases() { } } - @Test void primeFactorsTest() { + @Test + void primeFactorsTest() { for (PrimeFactorsOfNumberTestCase expected : this.primeFactorsTestCases) { @@ -169,8 +166,7 @@ void initPrimeFactorsOfNumberTestCases() { assertInstanceOf( NaturalNumber.class, answer, - String.format("Must be an instance of %s", NaturalNumber.class) - ); + String.format("Must be an instance of %s", NaturalNumber.class)); final Long[] answerPrimeFactors = answer.primeFactors(); final Integer answerPrimeFactorsCycles = answer.getPrimeFactorCycles(); @@ -180,7 +176,8 @@ void initPrimeFactorsOfNumberTestCases() { } } - @Test void primeFactorsCyclesWithoutCacheTest() { + @Test + void primeFactorsCyclesWithoutCacheTest() { for (PrimeFactorsOfNumberTestCase expected : this.primeFactorsTestCases) { @@ -190,8 +187,7 @@ void initPrimeFactorsOfNumberTestCases() { assertInstanceOf( NaturalNumber.class, answer, - String.format("Must be an instance of %s", NaturalNumber.class) - ); + String.format("Must be an instance of %s", NaturalNumber.class)); final Integer answerPrimeFactorsCycles = answer.getPrimeFactorCycles(); @@ -199,7 +195,8 @@ void initPrimeFactorsOfNumberTestCases() { } } - @Test void someNotPrimeNumbersCaseTest() { + @Test + void someNotPrimeNumbersCaseTest() { for (NextPrimeFactorOfNumberTestCase expected : this.nextPrimeFactorTestCases) { @@ -215,6 +212,5 @@ void initPrimeFactorsOfNumberTestCases() { assertEquals(expected.isPrime, NaturalNumber.isPrime(Long.valueOf(expected.input))); assertEquals(expected.cycles, answerCycles); } - } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/NumberToWordTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/NumberToWordTest.java index f32566c4..8f85f38a 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/NumberToWordTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/NumberToWordTest.java @@ -6,9 +6,9 @@ import org.junit.jupiter.api.Test; - class NumberToWordTest { - @Test void numberToWordTwoDigitsTest() throws Exception { + @Test + void numberToWordTwoDigitsTest() throws Exception { // Test static way assertEquals("one", NumberToWord.numberToWord(1)); assertEquals("sixteen", NumberToWord.numberToWord(16)); @@ -17,14 +17,16 @@ class NumberToWordTest { assertEquals("sixty-four", NumberToWord.numberToWord(64)); } - @Test void numberToWordThreeDigitsTest() throws Exception { + @Test + void numberToWordThreeDigitsTest() throws Exception { // Test static way assertEquals("three hundred and one", NumberToWord.numberToWord(301)); assertEquals("three hundred and forty-eight", NumberToWord.numberToWord(348)); assertEquals("five hundred", NumberToWord.numberToWord(500)); } - @Test void numberToWordBorderCasesTest() throws Exception { + @Test + void numberToWordBorderCasesTest() throws Exception { // Test static way assertEquals("one thousand", NumberToWord.numberToWord(1000)); @@ -32,18 +34,24 @@ class NumberToWordTest { String expectedMessage; String actualMessage; - exception = assertThrows(Exception.class, () -> { - NumberToWord.numberToWord(-1); - }); + exception = + assertThrows( + Exception.class, + () -> { + NumberToWord.numberToWord(-1); + }); expectedMessage = "Invalid value"; actualMessage = exception.getMessage(); assertTrue(actualMessage.contains(expectedMessage)); - exception = assertThrows(Exception.class, () -> { - NumberToWord.numberToWord(1001); - }); + exception = + assertThrows( + Exception.class, + () -> { + NumberToWord.numberToWord(1001); + }); expectedMessage = "Invalid value"; actualMessage = exception.getMessage(); diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/PalindromeTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/PalindromeTest.java index 5763ce9a..5ddaccce 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/PalindromeTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/PalindromeTest.java @@ -4,7 +4,6 @@ import org.junit.jupiter.api.Test; - class PalindromeTest { private class PalindromTestCase { @@ -17,11 +16,10 @@ private class PalindromTestCase { } } - @Test void listOfPalindromBorderCaseTest() { + @Test + void listOfPalindromBorderCaseTest() { - PalindromTestCase[] testCases = { - new PalindromTestCase(1L, true) - }; + PalindromTestCase[] testCases = {new PalindromTestCase(1L, true)}; for (PalindromTestCase testCase : testCases) { assertEquals(testCase.answer, Palindrome.isPalindrome(testCase.input)); diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/ProductTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/ProductTest.java index 18a3943d..264c05b2 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/ProductTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/ProductTest.java @@ -4,12 +4,12 @@ import org.junit.jupiter.api.Test; - class ProductTest { - @Test void productOfEmptyListTest() { + @Test + void productOfEmptyListTest() { - Long[] input = new Long[]{}; + Long[] input = new Long[] {}; Long expectedAnswer = 0L; // Test static way @@ -17,27 +17,30 @@ class ProductTest { assertEquals(expectedAnswer, Product.product(input)); } - @Test void productByZeroTest() { + @Test + void productByZeroTest() { - Long[] input = new Long[]{0L, -1L, 2L, -3L, 4L}; + Long[] input = new Long[] {0L, -1L, 2L, -3L, 4L}; Long expectedAnswer = 0L; // Test static way assertEquals(expectedAnswer, Product.product(input)); } - @Test void productOfSomeConsecutiveNumbersTest() { + @Test + void productOfSomeConsecutiveNumbersTest() { - Long[] input = new Long[]{1L, -2L, 3L, -4L}; + Long[] input = new Long[] {1L, -2L, 3L, -4L}; Long expectedAnswer = 24L; // Test static way assertEquals(expectedAnswer, Product.product(input)); } - @Test void productOfSomeNegativeAndPositiveNumbersTest() { + @Test + void productOfSomeNegativeAndPositiveNumbersTest() { - Long[] input = new Long[]{-1L, -2L, 1L, 2L}; + Long[] input = new Long[] {-1L, -2L, 1L, 2L}; Long expectedAnswer = 4L; // Test static way diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/SumTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/SumTest.java index e837b6f0..3e14791a 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/SumTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/SumTest.java @@ -4,10 +4,10 @@ import org.junit.jupiter.api.Test; - class SumTest { - @Test void productOfEmptyListTest() { + @Test + void productOfEmptyListTest() { Long expectedAnswer = 0L; @@ -15,29 +15,32 @@ class SumTest { Long[] inputNull = null; assertEquals(expectedAnswer, Sum.sum(inputNull)); - Long[] inputEmpty = new Long[]{}; + Long[] inputEmpty = new Long[] {}; assertEquals(expectedAnswer, Sum.sum(inputEmpty)); } - @Test void sumOfSomeConsecutiveNumbersTest() { + @Test + void sumOfSomeConsecutiveNumbersTest() { - Long[] input = new Long[]{1L, 2L, 3L, 4L}; + Long[] input = new Long[] {1L, 2L, 3L, 4L}; Long expectedAnswer = 10L; // Test static way assertEquals(expectedAnswer, Sum.sum(input)); } - @Test void sumOfSomepositiveAndNegativeNumbersTest() { + @Test + void sumOfSomepositiveAndNegativeNumbersTest() { - Long[] input = new Long[]{-1L, -2L, 1L, 2L}; + Long[] input = new Long[] {-1L, -2L, 1L, 2L}; Long expectedAnswer = 0L; // Test static way assertEquals(expectedAnswer, Sum.sum(input)); } - @Test void sumOfEmptyListTest() { + @Test + void sumOfEmptyListTest() { Long expectedAnswer = 0L; @@ -45,7 +48,7 @@ class SumTest { Long[] inputNull = null; assertEquals(expectedAnswer, Sum.sum(inputNull)); - Long[] inputEmpty = new Long[]{}; + Long[] inputEmpty = new Long[] {}; assertEquals(expectedAnswer, Sum.sum(inputEmpty)); Integer expectediAnswer = 0; @@ -53,7 +56,7 @@ class SumTest { Integer[] inputiNull = null; assertEquals(expectediAnswer, Sum.sum(inputiNull)); - Integer[] inputiEmpty = new Integer[]{}; + Integer[] inputiEmpty = new Integer[] {}; assertEquals(expectediAnswer, Sum.sum(inputiEmpty)); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/WordScoreTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/WordScoreTest.java index ad12a896..1c22d286 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/WordScoreTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/helper/WordScoreTest.java @@ -5,10 +5,10 @@ import org.junit.jupiter.api.Test; - class WordScoreTest { - @Test void wordScoreTest() { + @Test + void wordScoreTest() { // Test static way assertEquals(1 + 2 + 3, WordScore.wordScore("ABC")); assertNotEquals(0, WordScore.wordScore("ABC")); @@ -20,7 +20,8 @@ class WordScoreTest { assertNotEquals(0, WordScore.wordScore("COLIN")); } - @Test void wordScoreWrongCasesTest() { + @Test + void wordScoreWrongCasesTest() { assertEquals(0, WordScore.wordScore("")); assertEquals(0, WordScore.wordScore("1")); assertEquals(0, WordScore.wordScore("#")); diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeBuilderTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeBuilderTest.java index e2ad5d87..173143ea 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeBuilderTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeBuilderTest.java @@ -9,16 +9,13 @@ import org.junit.jupiter.api.TestInstance; import org.junit.jupiter.api.TestInstance.Lifecycle; - @TestInstance(Lifecycle.PER_CLASS) class BinaryNodeBuilderTest { - private Integer[][] smallCaseData = { - {75}, - {95, 64} - }; + private Integer[][] smallCaseData = {{75}, {95, 64}}; - @Test void instanceCaseTest() { + @Test + void instanceCaseTest() { BinaryNodeBuilder classUnderTest = new BinaryNodeBuilder(); assertNotNull(classUnderTest); @@ -28,7 +25,8 @@ class BinaryNodeBuilderTest { String.format("Must be an instance of %s", BinaryNodeBuilder.class)); } - @Test void buildSmallTreeTest() { + @Test + void buildSmallTreeTest() { BinaryNodeBuilder builder = new BinaryNodeBuilder(); BinaryNode testTree = builder.buildBinaryNodeTree(smallCaseData); @@ -38,7 +36,8 @@ class BinaryNodeBuilderTest { assertEquals(64, testTree.getRight().getValue()); } - @Test void buildNullTreeTest() { + @Test + void buildNullTreeTest() { BinaryNodeBuilder builder = new BinaryNodeBuilder(); BinaryNode testTree = builder.buildBinaryNodeTree(null); @@ -46,7 +45,8 @@ class BinaryNodeBuilderTest { assertNull(testTree); } - @Test void buildEmptyTreeTest() { + @Test + void buildEmptyTreeTest() { Integer[][] emptyMatrix = {}; BinaryNodeBuilder builder = new BinaryNodeBuilder(); @@ -55,31 +55,23 @@ class BinaryNodeBuilderTest { assertNull(testTree); } - @Test void buildMalformedMatrix1TreeTest() { - Integer[][] emptyMatrix = { - {1}, - {2}, - {3} - }; + @Test + void buildMalformedMatrix1TreeTest() { + Integer[][] emptyMatrix = {{1}, {2}, {3}}; BinaryNodeBuilder builder = new BinaryNodeBuilder(); BinaryNode testTree = builder.buildBinaryNodeTree(emptyMatrix); - assertEquals(new BinaryNode(1), testTree); } - @Test void buildMalformedMatrix2TreeTest() { - Integer[][] emptyMatrix = { - {1}, - {}, - {3} - }; + @Test + void buildMalformedMatrix2TreeTest() { + Integer[][] emptyMatrix = {{1}, {}, {3}}; BinaryNodeBuilder builder = new BinaryNodeBuilder(); BinaryNode testTree = builder.buildBinaryNodeTree(emptyMatrix); - assertEquals(new BinaryNode(1), testTree); } } diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeTest.java index 1e3e66eb..11c06083 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeTest.java @@ -9,11 +9,11 @@ import org.junit.jupiter.api.TestInstance; import org.junit.jupiter.api.TestInstance.Lifecycle; - @TestInstance(Lifecycle.PER_CLASS) class BinaryNodeTest { - @Test void instanceCaseTest() { + @Test + void instanceCaseTest() { BinaryNode classUnderTest = new BinaryNode(0); assertNotNull(classUnderTest); @@ -23,7 +23,8 @@ class BinaryNodeTest { String.format("Must be an instance of %s", BinaryNode.class)); } - @Test void getValueTest() { + @Test + void getValueTest() { Integer value = 5; BinaryNode testNodeA = new BinaryNode(5); @@ -44,7 +45,8 @@ class BinaryNodeTest { assertEquals(value, testNodeD.getValue()); } - @Test void binaryNodeLeftTest() { + @Test + void binaryNodeLeftTest() { String valueA = "A"; String valueLeft = "Z"; @@ -55,7 +57,8 @@ class BinaryNodeTest { assertEquals(valueLeft, testNodeA.getLeft().getValue()); } - @Test void binaryNodeRightTest() { + @Test + void binaryNodeRightTest() { String valueA = "A"; String valueRight = "Z"; @@ -66,15 +69,15 @@ class BinaryNodeTest { assertEquals(valueRight, testNodeA.getRight().getValue()); } - @Test void binaryNodeBothBranchesTest() { + @Test + void binaryNodeBothBranchesTest() { String valueA = "A"; String valueLeft = "X"; String valueRight = "Y"; - BinaryNode testNodeA = new BinaryNode(valueA, - new BinaryNode(valueLeft), - new BinaryNode(valueRight) - ); + BinaryNode testNodeA = + new BinaryNode( + valueA, new BinaryNode(valueLeft), new BinaryNode(valueRight)); assertNotNull(testNodeA.getLeft()); assertNotNull(testNodeA.getRight()); @@ -82,7 +85,8 @@ class BinaryNodeTest { assertEquals(valueRight, testNodeA.getRight().getValue()); } - @Test void binaryNodeIsLeafTest() { + @Test + void binaryNodeIsLeafTest() { String valueA = "A"; // both branches are null @@ -91,31 +95,25 @@ class BinaryNodeTest { assertEquals(true, testNodeA.isLeaf()); // both child branches has values - testNodeA = new BinaryNode(valueA, - new BinaryNode(valueA), - new BinaryNode(valueA) - ); + testNodeA = + new BinaryNode( + valueA, new BinaryNode(valueA), new BinaryNode(valueA)); assertEquals(false, testNodeA.isLeaf()); // left branch is null - testNodeA = new BinaryNode(valueA, - null, - new BinaryNode(valueA) - ); + testNodeA = new BinaryNode(valueA, null, new BinaryNode(valueA)); assertEquals(false, testNodeA.isLeaf()); // right branch is null - testNodeA = new BinaryNode(valueA, - new BinaryNode(valueA), - null - ); + testNodeA = new BinaryNode(valueA, new BinaryNode(valueA), null); assertEquals(false, testNodeA.isLeaf()); } - @Test void binaryNodeEqualityTest() { + @Test + void binaryNodeEqualityTest() { // Same instance BinaryNode testNodeA = new BinaryNode("A"); assertEquals(testNodeA, testNodeA); @@ -124,9 +122,10 @@ class BinaryNodeTest { assertNotEquals(new BinaryNode("A"), new StringBuilder('A').toString()); // Same type, both with null type - assertEquals(new BinaryNode(), new BinaryNode()); + assertEquals(new BinaryNode(), new BinaryNode()); - // Two null values of different types can't be compared, so... both will be "equal" + // Two null values of different types can't be compared, so... both will be + // "equal" assertEquals(new BinaryNode(), new BinaryNode()); // Test different value types: diff --git a/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeWeightBuilderTest.java b/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeWeightBuilderTest.java index be36bc85..1cd8aaf6 100644 --- a/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeWeightBuilderTest.java +++ b/algorithm-exercises-java/src/test/java/ae/projecteuler/lib/BinaryNodeWeightBuilderTest.java @@ -10,16 +10,13 @@ import org.junit.jupiter.api.TestInstance; import org.junit.jupiter.api.TestInstance.Lifecycle; - @TestInstance(Lifecycle.PER_CLASS) class BinaryNodeWeightBuilderTest { - private Integer[][] smallCaseData = { - {75, 0}, - {95, 64} - }; + private Integer[][] smallCaseData = {{75, 0}, {95, 64}}; - @Test void instanceCaseTest() { + @Test + void instanceCaseTest() { BinaryNodeBuilder classUnderTest = new BinaryNodeWeightBuilder(); assertNotNull(classUnderTest); @@ -29,7 +26,8 @@ class BinaryNodeWeightBuilderTest { String.format("Must be an instance of %s", BinaryNodeWeightBuilder.class)); } - @Test void buildSmallTreeTest() { + @Test + void buildSmallTreeTest() { BinaryNodeWeightBuilder builder = new BinaryNodeWeightBuilder(); BinaryNode testTree = builder.buildBinaryNodeTreeWithWeight(smallCaseData); @@ -37,12 +35,13 @@ class BinaryNodeWeightBuilderTest { assertEquals(75 + 95, testTree.getLeft().getValue()); assertEquals(75 + 64, testTree.getRight().getValue()); - Integer[] expectedLeaves = {75 + 95, 75 + 64}; + Integer[] expectedLeaves = {75 + 95, 75 + 64}; assertArrayEquals(expectedLeaves, builder.getLeaves()); } - @Test void buildNullTreeTest() { + @Test + void buildNullTreeTest() { BinaryNodeWeightBuilder builder = new BinaryNodeWeightBuilder(); BinaryNode testTree = builder.buildBinaryNodeTreeWithWeight(null); @@ -50,7 +49,8 @@ class BinaryNodeWeightBuilderTest { assertNull(testTree); } - @Test void buildEmptyTreeTest() { + @Test + void buildEmptyTreeTest() { Integer[][] emptyMatrix = {}; BinaryNodeWeightBuilder builder = new BinaryNodeWeightBuilder(); @@ -59,12 +59,9 @@ class BinaryNodeWeightBuilderTest { assertNull(testTree); } - @Test void buildMalformedMatrix1TreeTest() { - Integer[][] emptyMatrix = { - {1}, - {2}, - {3} - }; + @Test + void buildMalformedMatrix1TreeTest() { + Integer[][] emptyMatrix = {{1}, {2}, {3}}; BinaryNodeWeightBuilder builder = new BinaryNodeWeightBuilder(); BinaryNode testTree = builder.buildBinaryNodeTreeWithWeight(emptyMatrix); @@ -72,12 +69,9 @@ class BinaryNodeWeightBuilderTest { assertEquals(new BinaryNode(1), testTree); } - @Test void buildMalformedMatrix2TreeTest() { - Integer[][] emptyMatrix = { - {1}, - {}, - {3} - }; + @Test + void buildMalformedMatrix2TreeTest() { + Integer[][] emptyMatrix = {{1}, {}, {3}}; BinaryNodeWeightBuilder builder = new BinaryNodeWeightBuilder(); BinaryNode testTree = builder.buildBinaryNodeTreeWithWeight(emptyMatrix);