BAEL-2797 wrongly renamed algorithms-2 package fixed

algorithms-genetic/src/main/java/com/baeldung/algorithms/RunAlgorithm.java

@@ -1,11 +1,11 @@
-package com.baeldung.math;
+package com.baeldung.algorithms;
+
+import com.baeldung.algorithms.ga.annealing.SimulatedAnnealing;
+import com.baeldung.algorithms.ga.ant_colony.AntColonyOptimization;
+import com.baeldung.algorithms.ga.binary.SimpleGeneticAlgorithm;
 
 import java.util.Scanner;
 
-import com.baeldung.math.ga.annealing.SimulatedAnnealing;
-import com.baeldung.math.ga.ant_colony.AntColonyOptimization;
-import com.baeldung.math.ga.binary.SimpleGeneticAlgorithm;
-
 public class RunAlgorithm {
 
 	public static void main(String[] args) throws InstantiationException, IllegalAccessException {

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/annealing/City.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.annealing;
+package com.baeldung.algorithms.ga.annealing;
 
 import lombok.Data;
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/annealing/SimulatedAnnealing.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.annealing;
+package com.baeldung.algorithms.ga.annealing;
 
 public class SimulatedAnnealing {
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/annealing/Travel.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.annealing;
+package com.baeldung.algorithms.ga.annealing;
 
 import java.util.ArrayList;
 import java.util.Collections;

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/ant_colony/Ant.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.ant_colony;
+package com.baeldung.algorithms.ga.ant_colony;
 
 public class Ant {
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/ant_colony/AntColonyOptimization.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.ant_colony;
+package com.baeldung.algorithms.ga.ant_colony;
 
 import java.util.ArrayList;
 import java.util.Arrays;

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/binary/Individual.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.binary;
+package com.baeldung.algorithms.ga.binary;
 
 import lombok.Data;
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/binary/Population.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.binary;
+package com.baeldung.algorithms.ga.binary;
 
 import java.util.ArrayList;
 import java.util.List;

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/binary/SimpleGeneticAlgorithm.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.binary;
+package com.baeldung.algorithms.ga.binary;
 
 import lombok.Data;
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/Knapsack.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.jenetics;
+package com.baeldung.algorithms.ga.jenetics;
 
 import static org.jenetics.engine.EvolutionResult.toBestPhenotype;
 import static org.jenetics.engine.limit.bySteadyFitness;

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/KnapsackFF.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.jenetics;
+package com.baeldung.algorithms.ga.jenetics;
 
 import java.util.function.Function;
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/KnapsackItem.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.jenetics;
+package com.baeldung.algorithms.ga.jenetics;
 
 import java.util.Random;
 import java.util.stream.Collector;

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/SimpleGeneticAlgorithm.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.jenetics;
+package com.baeldung.algorithms.ga.jenetics;
 
 import org.jenetics.BitChromosome;
 import org.jenetics.BitGene;

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/SpringsteenProblem.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.jenetics;
+package com.baeldung.algorithms.ga.jenetics;
 
 import static java.util.Objects.requireNonNull;
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/SpringsteenRecord.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.jenetics;
+package com.baeldung.algorithms.ga.jenetics;
 
 import static java.util.Objects.requireNonNull;
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/SubsetSum.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.jenetics;
+package com.baeldung.algorithms.ga.jenetics;
 
 import static java.util.Objects.requireNonNull;
 

algorithms-genetic/src/main/java/com/baeldung/algorithms/ga/jenetics/TravelingSalesman.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.jenetics;
+package com.baeldung.algorithms.ga.jenetics;
 
 import static java.lang.Math.PI;
 import static java.lang.Math.abs;

algorithms-genetic/src/test/java/com/baeldung/algorithms/AntColonyOptimizationLongRunningUnitTest.java

@@ -1,9 +1,9 @@
-package com.baeldung.math;
+package com.baeldung.algorithms;
 
+import com.baeldung.algorithms.ga.ant_colony.AntColonyOptimization;
 import org.junit.Assert;
 import org.junit.Test;
 
-import com.baeldung.math.ga.ant_colony.AntColonyOptimization;
 
 public class AntColonyOptimizationLongRunningUnitTest {
 

algorithms-genetic/src/test/java/com/baeldung/algorithms/BinaryGeneticAlgorithmLongRunningUnitTest.java

@@ -1,9 +1,9 @@
-package com.baeldung.math;
+package com.baeldung.algorithms;
 
+import com.baeldung.algorithms.ga.binary.SimpleGeneticAlgorithm;
 import org.junit.Assert;
 import org.junit.Test;
 
-import com.baeldung.math.ga.binary.SimpleGeneticAlgorithm;
 
 public class BinaryGeneticAlgorithmLongRunningUnitTest {
 

algorithms-genetic/src/test/java/com/baeldung/algorithms/SimulatedAnnealingLongRunningUnitTest.java

@@ -1,9 +1,9 @@
-package com.baeldung.math;
+package com.baeldung.algorithms;
 
+import com.baeldung.algorithms.ga.annealing.SimulatedAnnealing;
 import org.junit.Assert;
 import org.junit.Test;
 
-import com.baeldung.math.ga.annealing.SimulatedAnnealing;
 
 public class SimulatedAnnealingLongRunningUnitTest {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/RunAlgorithm.java

@@ -1,8 +1,8 @@
-package com.baeldung.math;
+package com.baeldung.algorithms;
 
 import java.util.Scanner;
 
-import com.baeldung.math.slope_one.SlopeOne;
+import com.baeldung.algorithms.slope_one.SlopeOne;
 
 public class RunAlgorithm {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/conversion/HexStringConverter.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.conversion;
+package com.baeldung.algorithms.conversion;
 
 import java.math.BigInteger;
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceBase.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.editdistance;
+package com.baeldung.algorithms.editdistance;
 
 import java.util.Arrays;
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceDynamicProgramming.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.editdistance;
+package com.baeldung.algorithms.editdistance;
 
 public class EditDistanceDynamicProgramming extends EditDistanceBase {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/editdistance/EditDistanceRecursive.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.editdistance;
+package com.baeldung.algorithms.editdistance;
 
 public class EditDistanceRecursive extends EditDistanceBase {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/ga/dijkstra/Dijkstra.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.dijkstra;
+package com.baeldung.algorithms.ga.dijkstra;
 
 import java.util.HashSet;
 import java.util.LinkedList;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/ga/dijkstra/Graph.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.dijkstra;
+package com.baeldung.algorithms.ga.dijkstra;
 
 import java.util.HashSet;
 import java.util.Set;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/ga/dijkstra/Node.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.ga.dijkstra;
+package com.baeldung.algorithms.ga.dijkstra;
 
 import java.util.HashMap;
 import java.util.LinkedList;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/CycleDetectionBruteForce.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 public class CycleDetectionBruteForce {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/CycleDetectionByFastAndSlowIterators.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 public class CycleDetectionByFastAndSlowIterators {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/CycleDetectionByHashing.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 import java.util.HashSet;
 import java.util.Set;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/CycleDetectionResult.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 public class CycleDetectionResult<T> {
     boolean cycleExists;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/CycleRemovalBruteForce.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 public class CycleRemovalBruteForce {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/CycleRemovalByCountingLoopNodes.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 public class CycleRemovalByCountingLoopNodes {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/CycleRemovalWithoutCountingLoopNodes.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 public class CycleRemovalWithoutCountingLoopNodes {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/linkedlist/Node.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 public class Node<T> {
     T data;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/maze/solver/BFSMazeSolver.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.maze.solver;
+package com.baeldung.algorithms.maze.solver;
 
 import java.util.ArrayList;
 import java.util.Collections;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/maze/solver/Coordinate.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.maze.solver;
+package com.baeldung.algorithms.maze.solver;
 
 public class Coordinate {
     int x;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/maze/solver/DFSMazeSolver.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.maze.solver;
+package com.baeldung.algorithms.maze.solver;
 
 import java.util.ArrayList;
 import java.util.Collections;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/maze/solver/Maze.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.maze.solver;
+package com.baeldung.algorithms.maze.solver;
 
 import java.io.File;
 import java.io.FileNotFoundException;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/maze/solver/MazeDriver.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.maze.solver;
+package com.baeldung.algorithms.maze.solver;
 
 import java.io.File;
 import java.util.List;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/numberwordconverter/NumberWordConverter.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.numberwordconverter;
+package com.baeldung.algorithms.numberwordconverter;
 
 import java.math.BigDecimal;
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/relativelyprime/RelativelyPrime.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.relativelyprime;
+package com.baeldung.algorithms.relativelyprime;
 
 import java.math.BigInteger;
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/reversingtree/TreeNode.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.reversingtree;
+package com.baeldung.algorithms.reversingtree;
 
 public class TreeNode {
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/reversingtree/TreeReverser.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.reversingtree;
+package com.baeldung.algorithms.reversingtree;
 
 import java.util.LinkedList;
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/romannumerals/RomanArabicConverter.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.romannumerals;
+package com.baeldung.algorithms.romannumerals;
 
 import java.util.List;
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/romannumerals/RomanNumeral.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.romannumerals;
+package com.baeldung.algorithms.romannumerals;
 
 import java.util.Arrays;
 import java.util.Comparator;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/slope_one/InputData.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.slope_one;
+package com.baeldung.algorithms.slope_one;
 
 import java.util.Arrays;
 import java.util.HashMap;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/slope_one/Item.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.slope_one;
+package com.baeldung.algorithms.slope_one;
 
 import lombok.AllArgsConstructor;
 import lombok.Data;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/slope_one/SlopeOne.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.slope_one;
+package com.baeldung.algorithms.slope_one;
 
 import java.text.DecimalFormat;
 import java.text.NumberFormat;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/slope_one/User.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.slope_one;
+package com.baeldung.algorithms.slope_one;
 
 import lombok.AllArgsConstructor;
 import lombok.Data;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/sudoku/BacktrackingAlgorithm.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.sudoku;
+package com.baeldung.algorithms.sudoku;
 
 import java.util.stream.IntStream;
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/sudoku/ColumnNode.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.sudoku;
+package com.baeldung.algorithms.sudoku;
 
 class ColumnNode extends DancingNode {
     int size;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/sudoku/DancingLinks.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.sudoku;
+package com.baeldung.algorithms.sudoku;
 
 import java.util.ArrayList;
 import java.util.LinkedList;

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/sudoku/DancingLinksAlgorithm.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.sudoku;
+package com.baeldung.algorithms.sudoku;
 
 import java.util.Arrays;
 

algorithms-miscellaneous-2/src/main/java/com/baeldung/algorithms/sudoku/DancingNode.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.sudoku;
+package com.baeldung.algorithms.sudoku;
 
 class DancingNode {
     DancingNode L, R, U, D;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/DijkstraAlgorithmLongRunningUnitTest.java

@@ -1,10 +1,10 @@
-package com.baeldung.math;
+package com.baeldung.algorithms;
 
 import org.junit.Test;
 
-import com.baeldung.math.ga.dijkstra.Dijkstra;
-import com.baeldung.math.ga.dijkstra.Graph;
-import com.baeldung.math.ga.dijkstra.Node;
+import com.baeldung.algorithms.ga.dijkstra.Dijkstra;
+import com.baeldung.algorithms.ga.dijkstra.Graph;
+import com.baeldung.algorithms.ga.dijkstra.Node;
 
 import java.util.Arrays;
 import java.util.List;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/analysis/AnalysisRunnerLiveTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.analysis;
+package com.baeldung.algorithms.analysis;
 
 import org.junit.Test;
 

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/conversion/ByteArrayConverterUnitTest.java

@@ -1,7 +1,6 @@
-package com.baeldung.math.conversion;
+package com.baeldung.algorithms.conversion;
 
 import static org.junit.Assert.assertArrayEquals;
-import static org.junit.Assert.assertEquals;
 import static org.junit.Assert.assertThat;
 
 import org.apache.commons.codec.DecoderException;
@@ -9,7 +8,6 @@ import org.hamcrest.text.IsEqualIgnoringCase;
 import org.junit.Before;
 import org.junit.Test;
 
-import com.baeldung.math.conversion.HexStringConverter;
 
 public class ByteArrayConverterUnitTest {
 

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/editdistance/EditDistanceDataProvider.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.editdistance;
+package com.baeldung.algorithms.editdistance;
 
 import org.junit.runners.Parameterized.Parameters;
 

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/editdistance/EditDistanceUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.editdistance;
+package com.baeldung.algorithms.editdistance;
 
 import org.junit.Test;
 import org.junit.runner.RunWith;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/linkedlist/CycleDetectionBruteForceUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 import org.junit.Assert;
 import org.junit.Test;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/linkedlist/CycleDetectionByFastAndSlowIteratorsUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 import org.junit.Assert;
 import org.junit.Test;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/linkedlist/CycleDetectionByHashingUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 import org.junit.Assert;
 import org.junit.Test;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/linkedlist/CycleDetectionTestBase.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 import java.util.Arrays;
 import java.util.Collection;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/linkedlist/CycleRemovalBruteForceUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 import org.junit.Assert;
 import org.junit.Test;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/linkedlist/CycleRemovalByCountingLoopNodesUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 import org.junit.Assert;
 import org.junit.Test;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/linkedlist/CycleRemovalWithoutCountingLoopNodesUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.linkedlist;
+package com.baeldung.algorithms.linkedlist;
 
 import org.junit.Assert;
 import org.junit.Test;

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/moneywords/NumberWordConverterUnitTest.java

@@ -1,10 +1,10 @@
-package com.baeldung.math.moneywords;
+package com.baeldung.algorithms.moneywords;
 
 import static org.junit.Assert.assertEquals;
 
 import org.junit.Test;
 
-import com.baeldung.math.numberwordconverter.NumberWordConverter;
+import com.baeldung.algorithms.numberwordconverter.NumberWordConverter;
 
 public class NumberWordConverterUnitTest {
 

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/relativelyprime/RelativelyPrimeUnitTest.java

@@ -1,8 +1,8 @@
-package com.baeldung.math.relativelyprime;
+package com.baeldung.algorithms.relativelyprime;
 
 import org.junit.Test;
 
-import static com.baeldung.math.relativelyprime.RelativelyPrime.*;
+import static com.baeldung.algorithms.relativelyprime.RelativelyPrime.*;
 import static org.assertj.core.api.Assertions.assertThat;
 
 public class RelativelyPrimeUnitTest {

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/reversingtree/TreeReverserUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.reversingtree;
+package com.baeldung.algorithms.reversingtree;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/romannumerals/RomanArabicConverterUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.math.romannumerals;
+package com.baeldung.algorithms.romannumerals;
 
 import static org.assertj.core.api.Assertions.assertThat;