Create 3432. Count Partitions with Even Sum Difference

Author: Chayandas07

3432. Count Partitions with Even Sum Difference

@@ -0,0 +1,9 @@
+class Solution {
+public:
+    int countPartitions(vector<int>& nums) {
+        int sum = 0;
+        for(int i = 0; i < nums.size(); i++) sum += nums[i];  
+        if(sum % 2 == 0) return nums.size() - 1;
+        return 0;
+    }
+};