Merge branch 'master' into SMJI/stack/min_max_const_time

Author: S-M-J-I

DIRECTORY.md

@@ -1014,11 +1014,14 @@
             * [ColorContrastRatioTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/ColorContrastRatioTest.java)
             * [InverseOfMatrixTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/InverseOfMatrixTest.java)
             * [MapReduceTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/MapReduceTest.java)
+            * [MatrixTransposeTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/MatrixTransposeTest.java)
             * [MedianOfMatrixtest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/MedianOfMatrixtest.java)
             * [MedianOfRunningArrayTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/MedianOfRunningArrayTest.java)
             * [MirrorOfMatrixTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/MirrorOfMatrixTest.java)
             * [PalindromeSinglyLinkedListTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/PalindromeSinglyLinkedListTest.java)
+            * [RangeInSortedArrayTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/RangeInSortedArrayTest.java)
             * [TwoSumProblemTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/TwoSumProblemTest.java)
+            * [WordBoggleTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/misc/WordBoggleTest.java)
           * others
             * [ArrayLeftRotationTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/others/ArrayLeftRotationTest.java)
             * [ArrayRightRotationTest](https://github.com/TheAlgorithms/Java/blob/master/src/test/java/com/thealgorithms/others/ArrayRightRotationTest.java)

src/main/java/com/thealgorithms/misc/MatrixTranspose.java

@@ -1,7 +1,5 @@
 package com.thealgorithms.misc;
 
-import java.util.Scanner;
-
 /**
  *
  *
@@ -22,62 +20,27 @@ public final class MatrixTranspose {
     private MatrixTranspose() {
     }
 
-    public static void main(String[] args) {
-        /*
-         * This is the main method
-         *
-         * @param args Unused.
-         *
-         * @return Nothing.
-         */
-        Scanner sc = new Scanner(System.in);
-        int i;
-        int j;
-        int row;
-        int column;
-        System.out.println("Enter the number of rows in the 2D matrix:");
-
-        /*
-         * Take input from user for how many rows to be print
-         */
-        row = sc.nextInt();
-
-        System.out.println("Enter the number of columns in the 2D matrix:");
-
-        /*
-         * Take input from user for how many coloumn to be print
-         */
-        column = sc.nextInt();
-        int[][] arr = new int[row][column];
-        System.out.println("Enter the elements");
-        for (i = 0; i < row; i++) {
-            for (j = 0; j < column; j++) {
-                arr[i][j] = sc.nextInt();
-            }
-        }
-
-        /*
-         * Print matrix before the Transpose in proper way
-         */
-        System.out.println("The matrix is:");
-        for (i = 0; i < row; i++) {
-            for (j = 0; j < column; j++) {
-                System.out.print(arr[i][j] + "\t");
-            }
-            System.out.print("\n");
+    /**
+     * Calculate the transpose of the given matrix.
+     *
+     * @param matrix The matrix to be transposed
+     * @throws IllegalArgumentException if the matrix is empty
+     * @throws NullPointerException     if the matrix is null
+     * @return The transposed matrix
+     */
+    public static int[][] transpose(int[][] matrix) {
+        if (matrix == null || matrix.length == 0) {
+            throw new IllegalArgumentException("Matrix is empty");
         }
 
-        /*
-         * Print matrix after the tranpose in proper way Transpose means Interchanging
-         * of rows wth column so we interchange the rows in next loop Thus at last
-         * matrix of transpose is obtained through user input...
-         */
-        System.out.println("The Transpose of the given matrix is:");
-        for (i = 0; i < column; i++) {
-            for (j = 0; j < row; j++) {
-                System.out.print(arr[j][i] + "\t");
+        int rows = matrix.length;
+        int cols = matrix[0].length;
+        int[][] transposedMatrix = new int[cols][rows];
+        for (int i = 0; i < cols; i++) {
+            for (int j = 0; j < rows; j++) {
+                transposedMatrix[i][j] = matrix[j][i];
             }
-            System.out.print("\n");
         }
+        return transposedMatrix;
     }
 }

src/main/java/com/thealgorithms/misc/RangeInSortedArray.java

@@ -1,18 +1,9 @@
 package com.thealgorithms.misc;
 
-import java.util.Arrays;
-
 public final class RangeInSortedArray {
     private RangeInSortedArray() {
     }
 
-    public static void main(String[] args) {
-        // Testcases
-        assert Arrays.equals(sortedRange(new int[] {1, 2, 3, 3, 3, 4, 5}, 3), new int[] {2, 4});
-        assert Arrays.equals(sortedRange(new int[] {1, 2, 3, 3, 3, 4, 5}, 4), new int[] {5, 5});
-        assert Arrays.equals(sortedRange(new int[] {0, 1, 2}, 3), new int[] {-1, -1});
-    }
-
     // Get the 1st and last occurrence index of a number 'key' in a non-decreasing array 'nums'
     // Gives [-1, -1] in case element doesn't exist in array
     public static int[] sortedRange(int[] nums, int key) {

src/main/java/com/thealgorithms/misc/WordBoggle.java

@@ -1,7 +1,6 @@
 package com.thealgorithms.misc;
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.HashMap;
 import java.util.HashSet;
 import java.util.List;
@@ -32,36 +31,6 @@ public static List<String> boggleBoard(char[][] board, String[] words) {
         return new ArrayList<>(finalWords);
     }
 
-    public static void main(String[] args) {
-        // Testcase
-        List<String> ans = new ArrayList<>(Arrays.asList("a", "boggle", "this", "NOTRE_PEATED", "is", "simple", "board"));
-        assert (boggleBoard(
-            new char[][] {
-                {'t', 'h', 'i', 's', 'i', 's', 'a'},
-                {'s', 'i', 'm', 'p', 'l', 'e', 'x'},
-                {'b', 'x', 'x', 'x', 'x', 'e', 'b'},
-                {'x', 'o', 'g', 'g', 'l', 'x', 'o'},
-                {'x', 'x', 'x', 'D', 'T', 'r', 'a'},
-                {'R', 'E', 'P', 'E', 'A', 'd', 'x'},
-                {'x', 'x', 'x', 'x', 'x', 'x', 'x'},
-                {'N', 'O', 'T', 'R', 'E', '_', 'P'},
-                {'x', 'x', 'D', 'E', 'T', 'A', 'E'},
-            },
-            new String[] {
-                "this",
-                "is",
-                "not",
-                "a",
-                "simple",
-                "test",
-                "boggle",
-                "board",
-                "REPEATED",
-                "NOTRE_PEATED",
-            })
-                    .equals(ans));
-    }
-
     public static void explore(int i, int j, char[][] board, TrieNode trieNode, boolean[][] visited, Set<String> finalWords) {
         if (visited[i][j]) {
             return;

src/test/java/com/thealgorithms/misc/MatrixTransposeTest.java

@@ -0,0 +1,33 @@
+package com.thealgorithms.misc;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertThrows;
+
+import java.util.stream.Stream;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+public class MatrixTransposeTest {
+
+    private static Stream<Arguments> provideValidMatrixTestCases() {
+        return Stream.of(Arguments.of(new int[][] {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}}, new int[][] {{1, 4, 7}, {2, 5, 8}, {3, 6, 9}}, "Transpose of square matrix"), Arguments.of(new int[][] {{1, 2}, {3, 4}, {5, 6}}, new int[][] {{1, 3, 5}, {2, 4, 6}}, "Transpose of rectangular matrix"),
+            Arguments.of(new int[][] {{1, 2, 3}}, new int[][] {{1}, {2}, {3}}, "Transpose of single-row matrix"), Arguments.of(new int[][] {{1}, {2}, {3}}, new int[][] {{1, 2, 3}}, "Transpose of single-column matrix"));
+    }
+
+    private static Stream<Arguments> provideInvalidMatrixTestCases() {
+        return Stream.of(Arguments.of(new int[0][0], "Empty matrix should throw IllegalArgumentException"), Arguments.of(null, "Null matrix should throw IllegalArgumentException"));
+    }
+
+    @ParameterizedTest(name = "Test case {index}: {2}")
+    @MethodSource("provideValidMatrixTestCases")
+    void testValidMatrixTranspose(int[][] input, int[][] expected, String description) {
+        assertArrayEquals(expected, MatrixTranspose.transpose(input), description);
+    }
+
+    @ParameterizedTest(name = "Test case {index}: {1}")
+    @MethodSource("provideInvalidMatrixTestCases")
+    void testInvalidMatrixTranspose(int[][] input, String description) {
+        assertThrows(IllegalArgumentException.class, () -> MatrixTranspose.transpose(input), description);
+    }
+}

src/test/java/com/thealgorithms/misc/RangeInSortedArrayTest.java

@@ -0,0 +1,35 @@
+package com.thealgorithms.misc;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import java.util.stream.Stream;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+public class RangeInSortedArrayTest {
+
+    @ParameterizedTest(name = "Test case {index}: {3}")
+    @MethodSource("provideSortedRangeTestCases")
+    void testSortedRange(int[] nums, int key, int[] expectedRange, String description) {
+        assertArrayEquals(expectedRange, RangeInSortedArray.sortedRange(nums, key), description);
+    }
+
+    private static Stream<Arguments> provideSortedRangeTestCases() {
+        return Stream.of(Arguments.of(new int[] {1, 2, 3, 3, 3, 4, 5}, 3, new int[] {2, 4}, "Range for key 3 with multiple occurrences"), Arguments.of(new int[] {1, 2, 3, 3, 3, 4, 5}, 4, new int[] {5, 5}, "Range for key 4 with single occurrence"),
+            Arguments.of(new int[] {0, 1, 2}, 3, new int[] {-1, -1}, "Range for non-existent key"), Arguments.of(new int[] {}, 1, new int[] {-1, -1}, "Range in empty array"), Arguments.of(new int[] {1, 1, 1, 2, 3, 4, 5, 5, 5}, 1, new int[] {0, 2}, "Range for key at start"),
+            Arguments.of(new int[] {1, 1, 1, 2, 3, 4, 5, 5, 5}, 5, new int[] {6, 8}, "Range for key at end"));
+    }
+
+    @ParameterizedTest(name = "Test case {index}: {3}")
+    @MethodSource("provideGetCountLessThanTestCases")
+    void testGetCountLessThan(int[] nums, int key, int expectedCount, String description) {
+        assertEquals(expectedCount, RangeInSortedArray.getCountLessThan(nums, key), description);
+    }
+
+    private static Stream<Arguments> provideGetCountLessThanTestCases() {
+        return Stream.of(Arguments.of(new int[] {1, 2, 3, 3, 4, 5}, 3, 4, "Count of elements less than existing key"), Arguments.of(new int[] {1, 2, 3, 3, 4, 5}, 4, 5, "Count of elements less than non-existing key"), Arguments.of(new int[] {1, 2, 2, 3}, 5, 4, "Count with all smaller elements"),
+            Arguments.of(new int[] {2, 3, 4, 5}, 1, 0, "Count with no smaller elements"), Arguments.of(new int[] {}, 1, 0, "Count in empty array"));
+    }
+}

src/test/java/com/thealgorithms/misc/WordBoggleTest.java

@@ -0,0 +1,56 @@
+package com.thealgorithms.misc;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+import java.util.Arrays;
+import java.util.List;
+import java.util.stream.Stream;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.params.ParameterizedTest;
+import org.junit.jupiter.params.provider.Arguments;
+import org.junit.jupiter.params.provider.MethodSource;
+
+class WordBoggleTest {
+    private char[][] board;
+
+    @BeforeEach
+    void setup() {
+        board = new char[][] {
+            {'t', 'h', 'i', 's', 'i', 's', 'a'},
+            {'s', 'i', 'm', 'p', 'l', 'e', 'x'},
+            {'b', 'x', 'x', 'x', 'x', 'e', 'b'},
+            {'x', 'o', 'g', 'g', 'l', 'x', 'o'},
+            {'x', 'x', 'x', 'D', 'T', 'r', 'a'},
+            {'R', 'E', 'P', 'E', 'A', 'd', 'x'},
+            {'x', 'x', 'x', 'x', 'x', 'x', 'x'},
+            {'N', 'O', 'T', 'R', 'E', '_', 'P'},
+            {'x', 'x', 'D', 'E', 'T', 'A', 'E'},
+        };
+    }
+
+    @ParameterizedTest
+    @MethodSource("provideTestCases")
+    void testBoggleBoard(String[] words, List<String> expectedWords, String testDescription) {
+        List<String> result = WordBoggle.boggleBoard(board, words);
+        assertEquals(expectedWords.size(), result.size(), "Test failed for: " + testDescription);
+        assertTrue(expectedWords.containsAll(result), "Test failed for: " + testDescription);
+    }
+
+    private static Stream<Arguments> provideTestCases() {
+        return Stream.of(Arguments.of(new String[] {"this", "is", "not", "a", "simple", "test", "boggle", "board", "REPEATED", "NOTRE_PEATED"}, Arrays.asList("this", "is", "a", "simple", "board", "boggle", "NOTRE_PEATED"), "All words"),
+            Arguments.of(new String[] {"xyz", "hello", "world"}, List.of(), "No matching words"), Arguments.of(new String[] {}, List.of(), "Empty words array"), Arguments.of(new String[] {"this", "this", "board", "board"}, Arrays.asList("this", "board"), "Duplicate words in input"));
+    }
+
+    @ParameterizedTest
+    @MethodSource("provideSpecialCases")
+    void testBoggleBoardSpecialCases(char[][] specialBoard, String[] words, List<String> expectedWords, String testDescription) {
+        List<String> result = WordBoggle.boggleBoard(specialBoard, words);
+        assertEquals(expectedWords.size(), result.size(), "Test failed for: " + testDescription);
+        assertTrue(expectedWords.containsAll(result), "Test failed for: " + testDescription);
+    }
+
+    private static Stream<Arguments> provideSpecialCases() {
+        return Stream.of(Arguments.of(new char[0][0], new String[] {"this", "is", "a", "test"}, List.of(), "Empty board"));
+    }
+}