From 5d771745ac57c89c93e8dd9231f1d67fd1cea255 Mon Sep 17 00:00:00 2001
From: Swati Prajapati <42577922+swatiprajapati08@users.noreply.github.com>
Date: Wed, 3 Jun 2020 15:19:55 +0530
Subject: [PATCH] Update Minimum sum partition

Added some test cases for better understanding.
---
 DynamicProgramming/Minimum sum partition | 14 ++++++++++++++
 1 file changed, 14 insertions(+)

diff --git a/DynamicProgramming/Minimum sum partition b/DynamicProgramming/Minimum sum partition
index 2ab1d134c..3763d5bd6 100644
--- a/DynamicProgramming/Minimum sum partition	
+++ b/DynamicProgramming/Minimum sum partition	
@@ -1,5 +1,19 @@
 // Partition a set into two subsets such that the difference of subset sums is minimum
 
+/* 
+Input:  arr[] = {1, 6, 11, 5} 
+Output: 1
+Explanation:
+Subset1 = {1, 5, 6}, sum of Subset1 = 12 
+Subset2 = {11}, sum of Subset2 = 11    
+
+Input:  arr[] = {36, 7, 46, 40}
+Output: 23
+Explanation:
+Subset1 = {7, 46} ;  sum of Subset1 = 53
+Subset2 = {36, 40} ; sum of Subset2  = 76
+ */
+
 import java.util.*;
 import java.lang.*;
 import java.io.*;