Format: Google java formatter

Author: github-actions

DynamicProgramming/CountOfSubsetsWithAGivenDifference/Solution.java

@@ -5,7 +5,6 @@
 /**
  * * Count of Subsets With A Given Difference (Variation of 0/1 Knapsack)
  */
-
 public class Solution {
   public int countOfSubsets(int[] array, int difference) {
     int sum = Arrays.stream(array).sum();
@@ -15,20 +14,20 @@ public int countOfSubsets(int[] array, int difference) {
 
   /**
    * * Dynamic Programming Approach
-   * 
+   *
    * * TC: O(ns)
    * * SC: O(ns)
    */
   private int countOfSubsetsDP(int[] array, int sum, int difference) {
     /**
      * Equation I: S1 - S2 = difference
      * Equation II: S1 + S2 = sum(array)
-     * 
+     *
      * Adding I and II,
-     * 
+     *
      * 2S1 = sum(array) + difference
      * so, S1 = (sum(array) + difference) / 2
-     * 
+     *
      * Now, we need to find the count of
      * subsets equal to a given sum, which
      * is S1
@@ -71,4 +70,4 @@ public static void main(String[] args) {
 
     System.out.println(solution.countOfSubsets(new int[] {1, 1, 2, 3}, 1));
   }
-}
+}

DynamicProgramming/MinimumSubsetSumDifference/Solution.java

@@ -5,7 +5,6 @@
 /**
  * * Minimum Subset Sum Difference (Extension of 0/1 Knapsack)
  */
-
 public class Solution {
   public int minimumSubsetSumDifference(int[] array) {
     int sum = Arrays.stream(array).sum();
@@ -22,7 +21,7 @@ public int minimumSubsetSumDifference(int[] array) {
 
   /**
    * * Dynamic Programming Approach
-   * 
+   *
    * * TC: O(ns)
    * * SC: O(ns)
    */
@@ -66,11 +65,12 @@ private boolean[] subsetSum(int[] array, int sum) {
 
   /**
    * * Memoization Approach
-   * 
+   *
    * * TC: O(ns)
    * * SC: O(ns)
    */
-  // private int minimumSubsetSumDifferenceMem(int index, int[] array, int sumOne, int sumTwo, int[][] cache) {
+  // private int minimumSubsetSumDifferenceMem(int index, int[] array, int sumOne, int sumTwo,
+  // int[][] cache) {
   //   if (index == 0)
   //     return Math.abs(sumOne - sumTwo);
 
@@ -87,19 +87,19 @@ private boolean[] subsetSum(int[] array, int sum) {
 
   /**
    * * Recursive Approach
-   * 
+   *
    * * TC: O(2^n) approximately
    * * SC: O(2^n) approximately
    */
   // private int minimumSubsetSumDifferenceRec(int index, int[] array, int sumOne, int sumTwo) {
   //   if (index == 0) return Math.abs(sumOne - sumTwo);
 
-    // return Math.min(
-    //   minimumSubsetSumDifferenceRec(
-    //     index - 1, array, sumOne - array[index - 1], sumTwo + array[index - 1]
-    //   ),
-    //   minimumSubsetSumDifferenceRec(index - 1, array, sumOne, sumTwo)
-    // );
+  // return Math.min(
+  //   minimumSubsetSumDifferenceRec(
+  //     index - 1, array, sumOne - array[index - 1], sumTwo + array[index - 1]
+  //   ),
+  //   minimumSubsetSumDifferenceRec(index - 1, array, sumOne, sumTwo)
+  // );
   // }
 
   public static void main(String[] args) {
@@ -109,6 +109,6 @@ public static void main(String[] args) {
     System.out.println(solution.minimumSubsetSumDifference(new int[] {1, 6, 5, 11}));
 
     // should be 1
-    System.out.println(solution.minimumSubsetSumDifference(new int[] {2,7,4,1,8,1}));
+    System.out.println(solution.minimumSubsetSumDifference(new int[] {2, 7, 4, 1, 8, 1}));
   }
 }