diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
index 2108ecfb7..c40d8090f 100644
--- a/DynamicProgramming/MinimumSumPartition.java
+++ b/DynamicProgramming/MinimumSumPartition.java
@@ -32,16 +32,14 @@ public class MinimumSumPartition
         }
 
         //fill dp array
-        for(int i = 1; i <= n; i++){
-            for(int j = 1; j <= sum; j++){
-                if(arr[i-1] < j){
-                    dp[i][j] = dp[i-1][j - arr[i-1]] || dp[i-1][j];
-                }
-                else if(arr[i-1] == j){
+        for (int i = 1; i <= n; i++) {
+            for (int j = 1; j <= sum; j++) {
+                if (arr[i - 1] < j) {
+                    dp[i][j] = dp[i - 1][j - arr[i - 1]] || dp[i - 1][j];
+                } else if (arr[i - 1] == j) {
                     dp[i][j] = true;
-                }
-                else{
-                    dp[i][j] = dp[i-1][j];
+                } else {
+                    dp[i][j] = dp[i - 1][j];
                 }
             }
         }