Added a check for negative rod length in Rod Cutting algorithm

Author: Chiefpatwal

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

@@ -22,6 +22,10 @@ public static int cutRod(int[] price, int n) {
         if (price == null || price.length == 0) {
             throw new IllegalArgumentException("Price array cannot be null or empty.");
         }
+        // If rod length is negative
+        if (n < 0) {
+            throw new IllegalArgumentException("Rod length cannot be negative.");
+        }
         // Create an array to store the maximum obtainable values for each rod length.
         int[] val = new int[n + 1];
         val[0] = 0;

src/test/java/com/thealgorithms/dynamicprogramming/RodCuttingTest.java

@@ -93,4 +93,10 @@ void testCutRodEmptyPrices() {
         int length = 5;
         assertThrows(IllegalArgumentException.class, () -> RodCutting.cutRod(prices, length), "An empty prices array should throw an IllegalArgumentException.");
     }
+    @Test
+    void testCutRodNegativeLength() {
+        int[] prices = {1, 5, 8, 9, 10};
+        int length = -1;
+        assertThrows(IllegalArgumentException.class, () -> RodCutting.cutRod(prices, length), "A negative rod length should throw an IllegalArgumentException.");
+    }
 }