refactor: change packages (#5430)

* refactor: change package

* refactor: fix name

---------

Co-authored-by: alxkm <alx@alx.com>

src/main/java/com/thealgorithms/datastructures/graphs/FordFulkerson.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.dynamicprogramming;
+package com.thealgorithms.datastructures.graphs;
 
 import java.util.LinkedList;
 import java.util.Queue;

src/main/java/com/thealgorithms/dynamicprogramming/ShortestCommonSupersequenceLength.java

@@ -5,8 +5,8 @@ package com.thealgorithms.dynamicprogramming;
  * supersequence of two given strings. The shortest supersequence is the smallest string
  * that contains both given strings as subsequences.
  */
-final class ShortestCommonSuperSequenceLength {
-    private ShortestCommonSuperSequenceLength() {
+final class ShortestCommonSupersequenceLength {
+    private ShortestCommonSupersequenceLength() {
     }
 
     /**

src/main/java/com/thealgorithms/maths/EulersFunction.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 /**
  * Utility class for computing

src/main/java/com/thealgorithms/maths/SieveOfEratosthenes.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.maths;
 
 import java.util.Arrays;
 

src/main/java/com/thealgorithms/strings/KMP.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.strings;
 
 /**
  * Implementation of Knuth–Morris–Pratt algorithm Usage: see the main function

src/main/java/com/thealgorithms/strings/RabinKarp.java

@@ -1,4 +1,4 @@
-package com.thealgorithms.others;
+package com.thealgorithms.strings;
 
 import java.util.Scanner;