Two-Hundred-Fifty-Two Commit: Refactor Dynamic Programming section delete redundant files

Author: AAdewunmi

src/Dynamic_Programming/_0_1_Knapsack_Dynamic_Programming/Problem_1_0_1_Knapsack.java

@@ -1,4 +1,4 @@
-package Pattern_Dynamic_Programming._0_1_Knapsack;
+package Dynamic_Programming._1_0_Knapsack;
 
 // Problem Statement: 0/1 Knapsack (medium)
 // LeetCode Question:

src/Dynamic_Programming/_0_1_Knapsack_Dynamic_Programming/Problem_2_Equal_Sum_Partition.java

@@ -1,4 +1,4 @@
-package Pattern_Dynamic_Programming._0_1_Knapsack;
+package Dynamic_Programming._1_0_Knapsack;
 
 // Problem Statement: Equal Subset Sum Partition (medium)
 // LeetCode Question: 416. Partition Equal Subset Sum
@@ -45,5 +45,5 @@ public boolean canPartition(int[] num) {
         // the bottom-right corner will have our answer.
         return dp[n-1][sum];
     }
-
+    
 }

src/Dynamic_Programming/_0_1_Knapsack_Dynamic_Programming/Problem_3_Equal_Subset_Sum_Partition.java

@@ -1,4 +1,4 @@
-package Pattern_Dynamic_Programming._0_1_Knapsack;
+package Dynamic_Programming._1_0_Knapsack;
 
 // Problem Statement: Subset Sum (medium)
 // LeetCode Question:

src/Dynamic_Programming/_0_1_Knapsack_Dynamic_Programming/Problem_4_Minimum_Subset_Sum_Difference.java

@@ -1,4 +1,4 @@
-package Pattern_Dynamic_Programming._0_1_Knapsack;
+package Dynamic_Programming._1_0_Knapsack;
 
 // Problem Statement: Minimum Subset Sum Difference (hard)
 // LeetCode Question: 2035. Partition Array Into Two Arrays to Minimize Sum Difference

src/Dynamic_Programming/_0_1_Knapsack_Dynamic_Programming/Problem_5_Count_Of_Subset_Sum.java

@@ -1,4 +1,4 @@
-package Pattern_Dynamic_Programming._0_1_Knapsack;
+package Dynamic_Programming._1_0_Knapsack;
 
 // Problem Statement: Count of Subset Sum (hard)
 // LeetCode Question:

src/Dynamic_Programming/_0_1_Knapsack_Dynamic_Programming/Problem_6_Target_Sum.java

@@ -1,4 +1,4 @@
-package Pattern_Dynamic_Programming._0_1_Knapsack;
+package Dynamic_Programming._1_0_Knapsack;
 
 // Problem Statement: Target Sum (hard)
 // LeetCode Question: 494. Target Sum