Improved task 416

Author: javadev

src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java

@@ -17,9 +17,6 @@ public boolean canPartition(int[] nums) {
         int[] arr = new int[sum + 2];
         int top = 0;
         for (int val : nums) {
-            if (val == sum) {
-                return true;
-            }
             for (int i = top; i > -1; i--) {
                 int tempSum = val + arr[i];
                 if (tempSum <= sum && !set[tempSum]) {