From d44b608482c1c07abc59973c4b013b2a91488f17 Mon Sep 17 00:00:00 2001 From: OpenClaw Agent Date: Sat, 4 Apr 2026 04:15:44 +0000 Subject: [PATCH 1/3] fix: prevent NPE when array contains null elements When searching for a non-null key in an array that contains null elements, the sentinel linear search would throw a NullPointerException because it called array[i].compareTo(key) without checking if array[i] is null. Added null check for array[i] in the while loop condition to prevent NPE and return the correct index when array elements themselves are null. Issue: #7318 (related) --- .../java/com/thealgorithms/searches/SentinelLinearSearch.java | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/src/main/java/com/thealgorithms/searches/SentinelLinearSearch.java b/src/main/java/com/thealgorithms/searches/SentinelLinearSearch.java index 1a5903a5d134..473fc2c3f094 100644 --- a/src/main/java/com/thealgorithms/searches/SentinelLinearSearch.java +++ b/src/main/java/com/thealgorithms/searches/SentinelLinearSearch.java @@ -65,7 +65,8 @@ public > int find(T[] array, T key) { int i = 0; // Search without bound checking since sentinel guarantees we'll find the key - while (array[i].compareTo(key) != 0) { + // Null check for array element to prevent NPE when array contains null elements + while (array[i] != null && array[i].compareTo(key) != 0) { i++; } From 1f95d3bba53f19ff7a7713d512c0d5bcfa8a34e7 Mon Sep 17 00:00:00 2001 From: OpenClaw Bot Date: Wed, 22 Apr 2026 06:24:33 +0000 Subject: [PATCH 2/3] fix: remove malformed @author javadoc in AnyBaseToAnyBase (issue #7393) --- .../java/com/thealgorithms/conversions/AnyBaseToAnyBase.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java b/src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java index 7698cc832981..3d31cb3e7f6c 100644 --- a/src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java +++ b/src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java @@ -3,7 +3,7 @@ *

* Time Complexity: O(n) [or appropriate complexity] * Space Complexity: O(n) - * * @author Reshma Kakkirala + * @author Reshma Kakkirala */ package com.thealgorithms.conversions; From 8555c0e8d6dc51173414bd4f93a50e6370befa04 Mon Sep 17 00:00:00 2001 From: OpenClaw Bot Date: Wed, 22 Apr 2026 06:26:14 +0000 Subject: [PATCH 3/3] fix: remove malformed javadoc in ReverseString (part of issue #7393) --- src/main/java/com/thealgorithms/strings/ReverseString.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/com/thealgorithms/strings/ReverseString.java b/src/main/java/com/thealgorithms/strings/ReverseString.java index 7b918ebe1a59..e373dd0b7174 100644 --- a/src/main/java/com/thealgorithms/strings/ReverseString.java +++ b/src/main/java/com/thealgorithms/strings/ReverseString.java @@ -62,7 +62,7 @@ public static String reverse3(String string) { /** * Reverses the given string using a stack. * This method uses a stack to reverse the characters of the string. - * * @param str The input string to be reversed. + * @param str The input string to be reversed. * @return The reversed string. */ public static String reverseStringUsingStack(String str) {