From a51e635139d4bef15b3fd43804b05984d4dd2489 Mon Sep 17 00:00:00 2001
From: Evan Ferrao <evanferrao@gmail.com>
Date: Thu, 5 Feb 2026 17:54:44 +0530
Subject: [PATCH] provide alternate logic for subset2 and combination2

---
 Recursion/CombinationTwo.java | 1 +
 Recursion/SubsetTwo.java      | 3 ++-
 2 files changed, 3 insertions(+), 1 deletion(-)

diff --git a/Recursion/CombinationTwo.java b/Recursion/CombinationTwo.java
index 7b41866..ff6d4e0 100644
--- a/Recursion/CombinationTwo.java
+++ b/Recursion/CombinationTwo.java
@@ -14,6 +14,7 @@ class CombinationTwo {
         for (int i = currentIndex; i < candidates.length; i++){
 
             if (i > currentIndex && candidates[i] == candidates[i-1]) continue;
+            // or i != currentIndex would also work
 
             if (candidates[i] > target) break;
 
diff --git a/Recursion/SubsetTwo.java b/Recursion/SubsetTwo.java
index ca7aa97..35c5c1e 100644
--- a/Recursion/SubsetTwo.java
+++ b/Recursion/SubsetTwo.java
@@ -8,7 +8,8 @@ class SubsetTwo {
         ansList.add(new ArrayList<>(ds));
 
         for (int i = ind; i < nums.length; i++) {
-            if (i != ind && nums[i] == nums[i - 1]) continue;
+            if (i > ind && nums[i] == nums[i - 1]) continue;
+            // or i != ind would also work
 
             ds.add(nums[i]);
             findSubsets(i + 1, nums, ds, ansList);