diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
index 4796e7648..d9a2b3446 100644
--- a/DynamicProgramming/MinimumSumPartition.java
+++ b/DynamicProgramming/MinimumSumPartition.java
@@ -23,7 +23,7 @@ public class MinimumSumPartition
 	public static int subSet(int[] arr) {
         int n = arr.length;
         int sum = getSum(arr);
-        boolean dp[][] = new boolean[n+1][sum+1];
+        boolean[][] dp = new boolean[n + 1][sum + 1];
         for(int i = 0; i < n; i++){
             dp[i][0] = true;
         }