Add Mo's Algorithm and DiceThrower algorithms with comprehensive tests

* Fixed PartitionProblem.java documentation comment placement

Author: BEASTSHRIRAM

pom.xml

@@ -71,8 +71,7 @@
                 <artifactId>maven-compiler-plugin</artifactId>
                 <version>3.14.1</version>
                 <configuration>
-                    <source>21</source>
-                    <target>21</target>
+                    <release>21</release>
                     <compilerArgs>
                         <arg>-Xlint:all</arg>
                         <arg>-Xlint:-auxiliaryclass</arg>

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

@@ -1,3 +1,7 @@
+package com.thealgorithms.dynamicprogramming;
+
+import java.util.Arrays;
+
 /**
  * @author Md Asif Joardar
  *
@@ -13,11 +17,6 @@
  *
  * The time complexity of the solution is O(n × sum) and requires O(n × sum) space
  */
-
-package com.thealgorithms.dynamicprogramming;
-
-import java.util.Arrays;
-
 public final class PartitionProblem {
     private PartitionProblem() {
     }

src/test/java/com/thealgorithms/others/MosAlgorithmTest.java

@@ -192,9 +192,9 @@ void testMainMethod() {
             String output = outputStream.toString();
 
             // Verify expected output contains demonstration
-            assertTrue(output.contains("Range Sum Queries Results:"));
-            assertTrue(output.contains("Range Frequency Queries Results:"));
-            assertTrue(output.contains("Count of 2 in ranges:"));
+            assertTrue(output.contains("Range Sum Queries:"));
+            assertTrue(output.contains("Range Frequency Queries (count of value 3):"));
+            assertTrue(output.contains("Array: [1, 3, 5, 2, 7, 6, 3, 1, 4, 8]"));
         } finally {
             System.setOut(originalOut);
         }