BAEL-2797 new domain "math"created, sections moved

algorithms-miscellaneous-1/src/main/java/com/baeldung/algorithms/linesintersection/LinesIntersectionService.java

@@ -1,21 +0,0 @@
-package com.baeldung.algorithms.linesintersection;
-
-import java.awt.Point;
-import java.util.Optional;
-
-public class LinesIntersectionService {
-
-    public Optional<Point> calculateIntersectionPoint(double m1, double b1, double m2, double b2) {
-
-        if (m1 == m2) {
-            return Optional.empty();
-        }
-
-        double x = (b2 - b1) / (m1 - m2);
-        double y = m1 * x + b1;
-
-        Point point = new Point();
-        point.setLocation(x, y);
-        return Optional.of(point);
-    }
-}

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/automata/FiniteStateMachine.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.automata;
+package com.baeldung.math.automata;
 
 /**
  * Finite state machine.

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/automata/RtFiniteStateMachine.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.automata;
+package com.baeldung.math.automata;
 
 /**
  * Default implementation of a finite state machine.

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/automata/RtState.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/automata/RtTransition.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.automata;
+package com.baeldung.math.automata;
 
 
 /**

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/automata/State.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.automata;
+package com.baeldung.math.automata;
 
 /**
  * State. Part of a finite state machine.

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/automata/Transition.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.automata;
+package com.baeldung.math.automata;
 
 /**
  * Transition in a finite State machine.

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/binarysearch/BinarySearch.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/combination/ApacheCommonsCombinationGenerator.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/combination/CombinatoricsLibCombinationGenerator.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.combination;
+package com.baeldung.math.combination;
 
 import org.paukov.combinatorics3.Generator;
 

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/combination/GuavaCombinationsGenerator.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/combination/IterativeCombinationGenerator.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/combination/SelectionRecursiveCombinationGenerator.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/combination/SetRecursiveCombinationGenerator.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/enumstatemachine/LeaveRequestState.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.enumstatemachine;
+package com.baeldung.math.enumstatemachine;
 
 public enum LeaveRequestState {
 

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/factorial/Factorial.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.factorial;
+package com.baeldung.math.factorial;
 
 import java.math.BigInteger;
 import java.util.stream.LongStream;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/hillclimbing/HillClimbing.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/hillclimbing/State.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/kthlargest/FindKthLargest.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/mcts/montecarlo/MonteCarloTreeSearch.java

@@ -1,10 +1,10 @@
-package com.baeldung.algorithms.mcts.montecarlo;
+package com.baeldung.math.mcts.montecarlo;
 
 import java.util.List;
 
-import com.baeldung.algorithms.mcts.tictactoe.Board;
-import com.baeldung.algorithms.mcts.tree.Node;
-import com.baeldung.algorithms.mcts.tree.Tree;
+import com.baeldung.math.mcts.tictactoe.Board;
+import com.baeldung.math.mcts.tree.Node;
+import com.baeldung.math.mcts.tree.Tree;
 
 public class MonteCarloTreeSearch {
 

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/mcts/montecarlo/State.java

@@ -1,10 +1,10 @@
-package com.baeldung.algorithms.mcts.montecarlo;
+package com.baeldung.math.mcts.montecarlo;
 
 import java.util.ArrayList;
 import java.util.List;
 
-import com.baeldung.algorithms.mcts.tictactoe.Board;
-import com.baeldung.algorithms.mcts.tictactoe.Position;
+import com.baeldung.math.mcts.tictactoe.Board;
+import com.baeldung.math.mcts.tictactoe.Position;
 
 public class State {
     private Board board;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/mcts/montecarlo/UCT.java

@@ -1,10 +1,9 @@
-package com.baeldung.algorithms.mcts.montecarlo;
+package com.baeldung.math.mcts.montecarlo;
 
 import java.util.Collections;
 import java.util.Comparator;
-import java.util.List;
 
-import com.baeldung.algorithms.mcts.tree.Node;
+import com.baeldung.math.mcts.tree.Node;
 
 public class UCT {
 

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/mcts/tictactoe/Board.java

@@ -1,7 +1,6 @@
-package com.baeldung.algorithms.mcts.tictactoe;
+package com.baeldung.math.mcts.tictactoe;
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.List;
 
 public class Board {

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/mcts/tictactoe/Position.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.mcts.tictactoe;
+package com.baeldung.math.mcts.tictactoe;
 
 public class Position {
     int x;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/mcts/tree/Node.java

@@ -1,11 +1,11 @@
-package com.baeldung.algorithms.mcts.tree;
+package com.baeldung.math.mcts.tree;
 
 import java.util.ArrayList;
 import java.util.Collections;
 import java.util.Comparator;
 import java.util.List;
 
-import com.baeldung.algorithms.mcts.montecarlo.State;
+import com.baeldung.math.mcts.montecarlo.State;
 
 public class Node {
     State state;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/mcts/tree/Tree.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.mcts.tree;
+package com.baeldung.math.mcts.tree;
 
 public class Tree {
     Node root;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/middleelementlookup/MiddleElementLookup.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/middleelementlookup/Node.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.middleelementlookup;
+package com.baeldung.math.middleelementlookup;
 
 public class Node {
     private Node next;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/minimax/GameOfBones.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/minimax/MiniMax.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/minimax/Node.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/minimax/Tree.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.minimax;
+package com.baeldung.math.minimax;
 
 public class Tree {
     private Node root;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/multiswarm/Constants.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.multiswarm;
+package com.baeldung.math.multiswarm;
 
 /**
  * Constants used by the Multi-swarm optimization algorithms.

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/multiswarm/FitnessFunction.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.multiswarm;
+package com.baeldung.math.multiswarm;
 
 /**
  * Interface for a fitness function, used to decouple the main algorithm logic

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/multiswarm/Multiswarm.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/multiswarm/Particle.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/multiswarm/Swarm.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/permutation/Permutation.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/string/EnglishAlphabetLetters.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/string/LongestSubstringNonRepeatingCharacters.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/string/SubstringPalindrome.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/string/search/StringSearchAlgorithms.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.string.search;
+package com.baeldung.math.string.search;
 
 import java.math.BigInteger;
 import java.util.Random;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/twopointertechnique/LinkedListFindMiddle.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/twopointertechnique/MyNode.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.twopointertechnique;
+package com.baeldung.math.twopointertechnique;
 
 public class MyNode<E> {
     MyNode<E> next;

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/twopointertechnique/RotateArray.java

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

algorithms-miscellaneous-1/src/main/java/com/baeldung/math/twopointertechnique/TwoSum.java

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

algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/linesintersection/LinesIntersectionServiceUnitTest.java

@@ -1,40 +0,0 @@
-package com.baeldung.algorithms.linesintersection;
-
-import java.awt.Point;
-import java.util.Optional;
-
-import org.junit.Test;
-import static org.junit.Assert.assertTrue;
-import static org.junit.Assert.assertFalse;
-import static org.junit.Assert.assertEquals;
-
-public class LinesIntersectionServiceUnitTest {
-    private LinesIntersectionService service = new LinesIntersectionService();
-
-    @Test
-    public void givenNotParallelLines_whenCalculatePoint_thenPresent() {
-
-        double m1 = 0;
-        double b1 = 0;
-        double m2 = 1;
-        double b2 = -1;
-
-        Optional<Point> point = service.calculateIntersectionPoint(m1, b1, m2, b2);
-
-        assertTrue(point.isPresent());
-        assertEquals(point.get().getX(), 1, 0.001);
-        assertEquals(point.get().getY(), 0, 0.001);
-    }
-
-    @Test
-    public void givenParallelLines_whenCalculatePoint_thenEmpty() {
-        double m1 = 1;
-        double b1 = 0;
-        double m2 = 1;
-        double b2 = -1;
-
-        Optional<Point> point = service.calculateIntersectionPoint(m1, b1, m2, b2);
-
-        assertFalse(point.isPresent());
-    }
-}

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/HillClimbingAlgorithmUnitTest.java

@@ -1,7 +1,7 @@
-package com.baeldung.algorithms;
+package com.baeldung.math;
 
-import com.baeldung.algorithms.hillclimbing.HillClimbing;
-import com.baeldung.algorithms.hillclimbing.State;
+import com.baeldung.math.hillclimbing.HillClimbing;
+import com.baeldung.math.hillclimbing.State;
 import org.junit.Before;
 import org.junit.Test;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/MiddleElementLookupUnitTest.java

@@ -1,7 +1,7 @@
-package com.baeldung.algorithms;
+package com.baeldung.math;
 
-import com.baeldung.algorithms.middleelementlookup.MiddleElementLookup;
-import com.baeldung.algorithms.middleelementlookup.Node;
+import com.baeldung.math.middleelementlookup.MiddleElementLookup;
+import com.baeldung.math.middleelementlookup.Node;
 import org.junit.Test;
 
 import java.util.LinkedList;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/RtFiniteStateMachineLongRunningUnitTest.java

@@ -1,6 +1,6 @@
-package com.baeldung.algorithms;
+package com.baeldung.math;
 
-import com.baeldung.algorithms.automata.*;
+import com.baeldung.math.automata.*;
 import org.junit.Test;
 
 import static org.junit.Assert.assertTrue;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/StringSearchAlgorithmsUnitTest.java

@@ -1,10 +1,10 @@
-package com.baeldung.algorithms;
+package com.baeldung.math;
 
 
 import org.junit.Assert;
 import org.junit.Test;
 
-import com.baeldung.algorithms.string.search.StringSearchAlgorithms;
+import com.baeldung.math.string.search.StringSearchAlgorithms;
 
 public class StringSearchAlgorithmsUnitTest {
 	

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/binarysearch/BinarySearchUnitTest.java

@@ -1,11 +1,10 @@
-package com.baeldung.algorithms.binarysearch;
+package com.baeldung.math.binarysearch;
 
 import java.util.Arrays;
 import java.util.List;
 
 import org.junit.Assert;
 import org.junit.Test;
-import com.baeldung.algorithms.binarysearch.BinarySearch;
 
 public class BinarySearchUnitTest {
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/combination/CombinationUnitTest.java

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

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/enumstatemachine/LeaveRequestStateUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.enumstatemachine;
+package com.baeldung.math.enumstatemachine;
 
 import static org.junit.Assert.assertEquals;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/factorial/FactorialUnitTest.java

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

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/kthlargest/FindKthLargestUnitTest.java

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

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/mcts/MCTSUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.mcts;
+package com.baeldung.math.mcts;
 
 import static org.junit.Assert.assertEquals;
 import static org.junit.Assert.assertTrue;
@@ -8,12 +8,12 @@ import java.util.List;
 import org.junit.Before;
 import org.junit.Test;
 
-import com.baeldung.algorithms.mcts.montecarlo.MonteCarloTreeSearch;
-import com.baeldung.algorithms.mcts.montecarlo.State;
-import com.baeldung.algorithms.mcts.montecarlo.UCT;
-import com.baeldung.algorithms.mcts.tictactoe.Board;
-import com.baeldung.algorithms.mcts.tictactoe.Position;
-import com.baeldung.algorithms.mcts.tree.Tree;
+import com.baeldung.math.mcts.montecarlo.MonteCarloTreeSearch;
+import com.baeldung.math.mcts.montecarlo.State;
+import com.baeldung.math.mcts.montecarlo.UCT;
+import com.baeldung.math.mcts.tictactoe.Board;
+import com.baeldung.math.mcts.tictactoe.Position;
+import com.baeldung.math.mcts.tree.Tree;
 
 public class MCTSUnitTest {
     private Tree gameTree;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/minimax/MinimaxUnitTest.java

@@ -1,11 +1,9 @@
-package com.baeldung.algorithms.minimax;
+package com.baeldung.math.minimax;
 
 import org.junit.Before;
 import org.junit.Test;
 
 import static org.junit.Assert.*;
-import com.baeldung.algorithms.minimax.MiniMax;
-import com.baeldung.algorithms.minimax.Tree;
 
 public class MinimaxUnitTest {
     private Tree gameTree;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/multiswarm/LolFitnessFunction.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.multiswarm;
+package com.baeldung.math.multiswarm;
 
 /**
  * Specific fitness function implementation to solve the League of Legends

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/multiswarm/MultiswarmUnitTest.java

@@ -1,10 +1,10 @@
-package com.baeldung.algorithms.multiswarm;
+package com.baeldung.math.multiswarm;
 
 import org.junit.Assert;
 import org.junit.Rule;
 import org.junit.Test;
 
-import com.baeldung.algorithms.support.MayFailRule;
+import com.baeldung.math.support.MayFailRule;
 
 /**
  * Test for {@link Multiswarm}.

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/string/EnglishAlphabetLettersUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.string;
+package com.baeldung.math.string;
 
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/string/LongestSubstringNonRepeatingCharactersUnitTest.java

@@ -1,10 +1,10 @@
-package com.baeldung.algorithms.string;
+package com.baeldung.math.string;
 
 import org.junit.jupiter.api.Test;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
-import static com.baeldung.algorithms.string.LongestSubstringNonRepeatingCharacters.getUniqueCharacterSubstring;
-import static com.baeldung.algorithms.string.LongestSubstringNonRepeatingCharacters.getUniqueCharacterSubstringBruteForce;
+import static com.baeldung.math.string.LongestSubstringNonRepeatingCharacters.getUniqueCharacterSubstring;
+import static com.baeldung.math.string.LongestSubstringNonRepeatingCharacters.getUniqueCharacterSubstringBruteForce;
 
 public class LongestSubstringNonRepeatingCharactersUnitTest {
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/string/SubstringPalindromeUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.string;
+package com.baeldung.math.string;
 
 import static org.junit.Assert.assertEquals;
 import java.util.HashSet;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/support/MayFailRule.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.support;
+package com.baeldung.math.support;
 
 import org.junit.Rule;
 import org.junit.rules.TestRule;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/twopointertechnique/LinkedListFindMiddleUnitTest.java

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

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/twopointertechnique/RotateArrayUnitTest.java

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

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/twopointertechnique/TwoSumUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.twopointertechnique;
+package com.baeldung.math.twopointertechnique;
 
 import static org.junit.Assert.assertFalse;
 import static org.junit.Assert.assertTrue;