diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java index 514c3147a..9cbfe7ec2 100644 --- a/DynamicProgramming/MinimumSumPartition.java +++ b/DynamicProgramming/MinimumSumPartition.java @@ -1,3 +1,4 @@ +package DynamicProgramming; // Partition a set into two subsets such that the difference of subset sums is minimum /* @@ -17,56 +18,56 @@ Subset2 = {36, 40} ; sum of Subset2 = 76 import java.util.*; import java.lang.*; import java.io.*; -class GFG - { +public class MinimumSumPartition +{ public static void main (String[] args) - { - Scanner sc=new Scanner(System.in); - int t=sc.nextInt(); + { + Scanner sc = new Scanner(System.in); + int t = sc.nextInt(); while(t-->0) { - int n=sc.nextInt(); - int arr[]=new int[n]; - int sum=0; - for(int i=0;i