Fix listSubSequenceDuplicate method to remove duplication and update comments

pradeepkumar24rk · pradeepkumar24rk · commit 7e9f1b6ca9ce · 2026-03-21T12:12:45.000+05:30
diff --git a/ArrayBasedProblems/SubSequenceInArray.java b/ArrayBasedProblems/SubSequenceInArray.java
@@ -38,7 +38,7 @@ private static void listSubSequence() { // time complexity - o(n*2^n) duplicatio
         System.out.println(outer);
     }
 
-    private static void listSubSequenceDuplicate() { // time complexity - o(n*2^n) with duplication allow
+    private static void listSubSequenceDuplicate() { // time complexity - o(n*2^n) remove duplication
         int nums[] = { 1, 2, 2 };
         Arrays.sort(nums);
         ArrayList<ArrayList<Integer>> outer = new ArrayList<>();
@@ -50,14 +50,25 @@ private static void listSubSequenceDuplicate() { // time complexity - o(n*2^n) w
                 start = end + 1;
             end = outer.size() - 1;
             int n = outer.size();
-            for (int j = 0; j < n; j++) {
+            for (int j = start; j < n; j++) {
                 ArrayList<Integer> inter = new ArrayList<>(outer.get(j));
                 inter.add(nums[i]);
                 outer.add(inter);
             }
         }
         System.out.println(outer);
     }
+    
+    // [[], [1], [2], [1, 2], [2], [1, 2], [2, 2], [1, 2, 2] ] with duplication [2] [1,2] 
+    // Remove duplicate from above list 
+    
+    // if we have duplicate element initially we need to sort the array first.
+    // [[]]
+    // [[],[1]]
+    // [[],[1],[2],[1, 2]]
+    // Add new element [2] with new added element in list [2], [1, 2]
+    // [[],[1],[2],[1,2],[2,2],[1,2,2]]
+    
 
     private static void targetSumSubSequence() {
         int a[] = { 5, 3, 1, 6, 2 }, sumOfSquence = 6, n = a.length, total = (1 << n) - 1, count = 0;
