add 3432

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -93,6 +93,7 @@
 | 3450 | [Maximum Students on a Single Bench](https://leetcode.com/problems/maximum-students-on-a-single-bench/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3450.java) |                                                                               | Easy       |
 | 3442 | [Maximum Difference Between Even and Odd Frequency I](https://leetcode.com/problems/maximum-difference-between-even-and-odd-frequency-i/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3442.java) |                                                                               | Easy       |
 | 3438 | [Find Valid Pair of Adjacent Digits in String](https://leetcode.com/problems/find-valid-pair-of-adjacent-digits-in-string/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3438.java) |                                                                               | Easy       |
+| 3432 | [Count Partitions with Even Sum Difference](https://leetcode.com/problems/count-partitions-with-even-sum-difference/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3432.java) |                                                                               | Easy       |
 | 3411 | [Maximum Subarray With Equal Products](https://leetcode.com/problems/maximum-subarray-with-equal-products/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3411.java) |                                                                               | Easy       |
 | 3407 | [Substring Matching Pattern](https://leetcode.com/problems/substring-matching-pattern/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3407.java) |                                                                               | Easy       |
 | 3402 | [Minimum Operations to Make Columns Strictly Increasing](https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java) |                                                                               | Easy       |

src/main/java/com/fishercoder/solutions/fourththousand/_3432.java

@@ -0,0 +1,22 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3432 {
+    public static class Solution1 {
+        public int countPartitions(int[] nums) {
+            int count = 0;
+            long rightSum = 0L;
+            for (int i = 1; i < nums.length; i++) {
+                rightSum += nums[i];
+            }
+            long leftSum = nums[0];
+            for (int i = 1; i < nums.length; i++) {
+                if ((leftSum - rightSum) % 2 == 0) {
+                    count++;
+                }
+                leftSum += nums[i];
+                rightSum -= nums[i];
+            }
+            return count;
+        }
+    }
+}