diff --git a/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java b/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java
index f8cd0c40c20e..d05e33a4242f 100644
--- a/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java
+++ b/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java
@@ -20,8 +20,8 @@ private ArrayCombination() {
      * @throws IllegalArgumentException if n or k are negative, or if k is greater than n.
      */
     public static List<List<Integer>> combination(int n, int k) {
-        if (n < 0 || k < 0 || k > n) {
-            throw new IllegalArgumentException("Invalid input: n must be non-negative, k must be non-negative and less than or equal to n.");
+        if (k < 0 || k > n) {
+            throw new IllegalArgumentException("Invalid input: 0 ≤ k ≤ n is required.");
         }
 
         List<List<Integer>> combinations = new ArrayList<>();
@@ -48,7 +48,7 @@ private static void combine(List<List<Integer>> combinations, List<Integer> curr
         for (int i = start; i < n; i++) {
             current.add(i);
             combine(combinations, current, i + 1, n, k);
-            current.remove(current.size() - 1); // Backtrack
+            current.removeLast(); // Backtrack
         }
     }
 }