backtracking started

Author: Subham1999

.idea/workspace.xml

@@ -4,7 +4,7 @@
          xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
     <modelVersion>4.0.0</modelVersion>
 
-    <groupId>com.subham.ta</groupId>
+    <groupId>com.thealgorithm</groupId>
     <artifactId>TheAlgorithm</artifactId>
     <version>1.0-SNAPSHOT</version>
 

pom.xml

@@ -0,0 +1,7 @@
+package com.thealgorithm;
+
+public class Main {
+  public static void main(String[] args) {
+    System.out.println("Say! Hello Algoithm!!");
+  }
+}

src/main/java/com/subham/ta/Main.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array;
+package com.thealgorithm.array;
 
 public class AGraphIsAValidTree {
     private boolean cycleExist = false;

src/main/java/com/thealgorithm/Main.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array;
+package com.thealgorithm.array;
 
 import java.util.Arrays;
 

src/main/java/com/subham/ta/array/AGraphIsAValidTree.java renamed to src/main/java/com/thealgorithm/array/AGraphIsAValidTree.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array;
+package com.thealgorithm.array;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/com/subham/ta/array/IntQuickSort.java renamed to src/main/java/com/thealgorithm/array/IntQuickSort.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array;
+package com.thealgorithm.array;
 
 import java.util.function.Consumer;
 

src/main/java/com/subham/ta/array/LeetCode1024Hard.java renamed to src/main/java/com/thealgorithm/array/LeetCode1024Hard.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array;
+package com.thealgorithm.array;
 
 import java.util.Arrays;
 

src/main/java/com/subham/ta/array/LeetCode1605.java renamed to src/main/java/com/thealgorithm/array/LeetCode1605.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array;
+package com.thealgorithm.array;
 
 import java.util.Arrays;
 import java.util.HashMap;

src/main/java/com/subham/ta/array/LeetCode1636.java renamed to src/main/java/com/thealgorithm/array/LeetCode1636.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array;
+package com.thealgorithm.array;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/com/subham/ta/array/LeetCode2191.java renamed to src/main/java/com/thealgorithm/array/LeetCode2191.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array;
+package com.thealgorithm.array;
 
 public class NextPermutationFinder {
   public static void nextPermutation(int[] arr) {}

src/main/java/com/subham/ta/array/LeetCode2392.java renamed to src/main/java/com/thealgorithm/array/LeetCode2392.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array.matrix;
+package com.thealgorithm.array.matrix;
 
 import java.util.ArrayList;
 import java.util.Comparator;

src/main/java/com/subham/ta/array/NextPermutationFinder.java renamed to src/main/java/com/thealgorithm/array/NextPermutationFinder.java

@@ -1,4 +1,4 @@
-package com.subham.ta.array.matrix;
+package com.thealgorithm.array.matrix;
 
 public class SpiralIII {
   public static void main(String[] args) {

src/main/java/com/subham/ta/array/matrix/JumpOnMatrix.java renamed to src/main/java/com/thealgorithm/array/matrix/JumpOnMatrix.java

@@ -1,4 +1,4 @@
-package com.subham.ta.backtracking;
+package com.thealgorithm.backtracking;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/subham/ta/array/matrix/SpiralIII.java renamed to src/main/java/com/thealgorithm/array/matrix/SpiralIII.java

@@ -1,4 +1,4 @@
-package com.subham.ta.backtracking;
+package com.thealgorithm.backtracking;
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/com/subham/ta/backtracking/CombinationSumI.java renamed to src/main/java/com/thealgorithm/backtracking/CombinationSumI.java

@@ -1,4 +1,4 @@
-package com.subham.ta.backtracking;
+package com.thealgorithm.backtracking;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/subham/ta/backtracking/PermutationI.java renamed to src/main/java/com/thealgorithm/backtracking/PermutationI.java

@@ -0,0 +1,37 @@
+package com.thealgorithm.backtracking;
+
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.List;
+import java.util.Set;
+
+/**
+ * @author: Subham Santra
+ */
+public class SubsetsII {
+
+  public List<List<Integer>> subsetsWithDup(int[] nums) {
+    int len = nums.length;
+    int powerLen = 1 << len;
+
+    Set<List<Integer>> result = new HashSet<>();
+    for (int i = 0; i < powerLen; ++i) {
+      int j = i;
+      int k = 0;
+      List<Integer> set = new ArrayList<>();
+      while (j > 0) {
+        if ((j & 1) == 1) {
+          set.add(nums[k]);
+        }
+        ++k;
+        j >>= 1;
+      }
+      result.add(set);
+    }
+    return new ArrayList<>(result);
+  }
+
+  public static void main(String[] args) {
+    System.out.println(new SubsetsII().subsetsWithDup(new int[] {1, 2, 2, 1, 1, 1}));
+  }
+}

src/main/java/com/subham/ta/backtracking/Subsets.java renamed to src/main/java/com/thealgorithm/backtracking/Subsets.java

@@ -1,4 +1,4 @@
-package com.subham.ta.commons;
+package com.thealgorithm.commons;
 
 import java.util.*;
 

src/main/java/com/thealgorithm/backtracking/SubsetsII.java

@@ -1,4 +1,4 @@
-package com.subham.ta.commons;
+package com.thealgorithm.commons;
 
 import java.util.Objects;
 import lombok.Builder;

src/main/java/com/subham/ta/commons/DesignAFoodRatingSystems.java renamed to src/main/java/com/thealgorithm/commons/DesignAFoodRatingSystems.java

@@ -1,4 +1,4 @@
-package com.subham.ta.commons;
+package com.thealgorithm.commons;
 
 import java.util.Random;
 

src/main/java/com/subham/ta/commons/Pair.java renamed to src/main/java/com/thealgorithm/commons/Pair.java

@@ -1,4 +1,4 @@
-package com.subham.ta.commons;
+package com.thealgorithm.commons;
 
 import static java.util.Collections.swap;
 

src/main/java/com/subham/ta/commons/QuickSelect.java renamed to src/main/java/com/thealgorithm/commons/QuickSelect.java

@@ -1,4 +1,4 @@
-package com.subham.ta.competitive;
+package com.thealgorithm.competitive;
 
 import java.io.BufferedReader;
 import java.io.IOException;

src/main/java/com/subham/ta/commons/SmallestInfiniteSet.java renamed to src/main/java/com/thealgorithm/commons/SmallestInfiniteSet.java

@@ -1,4 +1,4 @@
-package com.subham.ta.concurr.que;
+package com.thealgorithm.concurr.que;
 
 public interface IQueue<T> {
   void add(T val);

src/main/java/com/subham/ta/competitive/CpTemplate.java renamed to src/main/java/com/thealgorithm/competitive/CpTemplate.java

@@ -1,4 +1,4 @@
-package com.subham.ta.concurr.que;
+package com.thealgorithm.concurr.que;
 
 import java.util.Random;
 import java.util.concurrent.ExecutorService;

src/main/java/com/subham/ta/concurr/que/IQueue.java renamed to src/main/java/com/thealgorithm/concurr/que/IQueue.java

@@ -1,4 +1,4 @@
-package com.subham.ta.concurr.que;
+package com.thealgorithm.concurr.que;
 
 import java.util.ArrayDeque;
 import java.util.Queue;

src/main/java/com/subham/ta/concurr/que/QueueTest.java renamed to src/main/java/com/thealgorithm/concurr/que/QueueTest.java

@@ -1,4 +1,4 @@
-package com.subham.ta.dp;
+package com.thealgorithm.dp;
 
 import java.util.Stack;
 

src/main/java/com/subham/ta/concurr/que/SimpleBlockingQueue.java renamed to src/main/java/com/thealgorithm/concurr/que/SimpleBlockingQueue.java

@@ -1,6 +1,7 @@
-package com.subham.ta.dp.lcs;
+package com.thealgorithm.dp.lcs;
+
+import com.thealgorithm.commons.Pair;
 
-import com.subham.ta.commons.Pair;
 import java.util.HashMap;
 import java.util.Map;
 

src/main/java/com/subham/ta/dp/Leetcode907.java renamed to src/main/java/com/thealgorithm/dp/Leetcode907.java

@@ -1,4 +1,4 @@
-package com.subham.ta.dp.lis;
+package com.thealgorithm.dp.lis;
 
 import java.util.Arrays;
 import java.util.Stack;

src/main/java/com/subham/ta/dp/lcs/LongestCommonSubsequence.java renamed to src/main/java/com/thealgorithm/dp/lcs/LongestCommonSubsequence.java

@@ -1,4 +1,4 @@
-package com.subham.ta.dp.miscelleneous;
+package com.thealgorithm.dp.miscelleneous;
 
 /**
  * @see <a

src/main/java/com/subham/ta/dp/lis/Leetcode1653.java renamed to src/main/java/com/thealgorithm/dp/lis/Leetcode1653.java

@@ -1,4 +1,4 @@
-package com.subham.ta.dp.miscelleneous;
+package com.thealgorithm.dp.miscelleneous;
 
 import java.util.Arrays;
 

src/main/java/com/subham/ta/dp/miscelleneous/LeetCode1155.java renamed to src/main/java/com/thealgorithm/dp/miscelleneous/LeetCode1155.java

@@ -1,4 +1,4 @@
-package com.subham.ta.dp.miscelleneous;
+package com.thealgorithm.dp.miscelleneous;
 
 import java.util.Arrays;
 

src/main/java/com/subham/ta/dp/miscelleneous/LeetCode1235.java renamed to src/main/java/com/thealgorithm/dp/miscelleneous/LeetCode1235.java

@@ -1,4 +1,4 @@
-package com.subham.ta.dp.miscelleneous;
+package com.thealgorithm.dp.miscelleneous;
 
 import java.util.ArrayList;
 import java.util.HashMap;

src/main/java/com/subham/ta/dp/miscelleneous/LeetCode1335.java renamed to src/main/java/com/thealgorithm/dp/miscelleneous/LeetCode1335.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.HashMap;
 import java.util.HashSet;

src/main/java/com/subham/ta/dp/miscelleneous/LeetCode446.java renamed to src/main/java/com/thealgorithm/dp/miscelleneous/LeetCode446.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.ArrayList;
 import java.util.HashMap;

src/main/java/com/subham/ta/graph/ArticulationPointOnDirectedGraph.java renamed to src/main/java/com/thealgorithm/graph/ArticulationPointOnDirectedGraph.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.ArrayList;
 import java.util.Arrays;

src/main/java/com/subham/ta/graph/CloneGraph.java renamed to src/main/java/com/thealgorithm/graph/CloneGraph.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.Objects;
 import lombok.AccessLevel;

src/main/java/com/subham/ta/graph/CoursesII.java renamed to src/main/java/com/thealgorithm/graph/CoursesII.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 public class FloydWarshallAlgorithm {
   static final int INF = Integer.MAX_VALUE;

src/main/java/com/subham/ta/graph/Edge.java renamed to src/main/java/com/thealgorithm/graph/Edge.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.HashSet;
 import java.util.Set;

src/main/java/com/subham/ta/graph/FloydWarshallAlgorithm.java renamed to src/main/java/com/thealgorithm/graph/FloydWarshallAlgorithm.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.AbstractMap;
 import java.util.ArrayDeque;

src/main/java/com/subham/ta/graph/Graph.java renamed to src/main/java/com/thealgorithm/graph/Graph.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;

src/main/java/com/subham/ta/graph/IslandsAndTreasures.java renamed to src/main/java/com/thealgorithm/graph/IslandsAndTreasures.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.math.BigInteger;
 

src/main/java/com/subham/ta/graph/LeetCode2045.java renamed to src/main/java/com/thealgorithm/graph/LeetCode2045.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.ArrayList;
 import java.util.Collections;

src/main/java/com/subham/ta/graph/LeetCode2976.java renamed to src/main/java/com/thealgorithm/graph/LeetCode2976.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.HashSet;
 import java.util.Objects;

src/main/java/com/subham/ta/graph/PacificAtlanticWaterFlow.java renamed to src/main/java/com/thealgorithm/graph/PacificAtlanticWaterFlow.java

@@ -1,4 +1,4 @@
-package com.subham.ta.graph;
+package com.thealgorithm.graph;
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;

src/main/java/com/subham/ta/graph/PrimsMST.java renamed to src/main/java/com/thealgorithm/graph/PrimsMST.java

@@ -1,4 +1,4 @@
-package com.subham.ta.hashtable;
+package com.thealgorithm.hashtable;
 
 import java.util.*;
 

src/main/java/com/subham/ta/graph/TopologicalSort.java renamed to src/main/java/com/thealgorithm/graph/TopologicalSort.java

@@ -1,4 +1,4 @@
-package com.subham.ta.lld;
+package com.thealgorithm.lld;
 
 class Service {
   public void doSomething(String key) {