refactor(searches): scope validation to rectangular matrices per review

Author: hardikkaurani

src/main/java/com/thealgorithms/searches/RowColumnWiseSorted2dArrayBinarySearch.java

@@ -36,11 +36,6 @@ public static <T extends Comparable<T>> int[] search(T[][] matrix, T target) {
         int colPointer = matrix[0].length - 1; // The pointer at end column
 
         while (rowPointer < matrix.length && colPointer >= 0) {
-            if (matrix[rowPointer] == null || colPointer >= matrix[rowPointer].length) {
-                rowPointer++;
-                continue;
-            }
-
             int comp = target.compareTo(matrix[rowPointer][colPointer]);
 
             if (comp == 0) {

src/test/java/com/thealgorithms/searches/RowColumnWiseSorted2dArrayBinarySearchTest.java

@@ -273,14 +273,10 @@ public void testNullTargetReturnsNotFound() {
     }
 
     @Test
-    public void testMatrixWithNullRow() {
-        Integer[][] matrix = {
-            {10, 20, 30},
-            null,
-            {18, 28, 38},
-        };
-        int[] ans = RowColumnWiseSorted2dArrayBinarySearch.search(matrix, 28);
-        int[] expected = {2, 1};
+    public void testNullFirstRowReturnsNotFound() {
+        Integer[][] matrix = {null};
+        int[] ans = RowColumnWiseSorted2dArrayBinarySearch.search(matrix, 5);
+        int[] expected = {-1, -1};
         assertEquals(expected[0], ans[0]);
         assertEquals(expected[1], ans[1]);
     }