en/lc/1664/

[giscus[bot]]

en/lc/1664/

LeetCode solutions in any programming language

https://leetcode.doocs.org/en/lc/1664/

[rajputanisha]

This code will you to clearly understand the problem and intuition behind the logic building.
#include
using namespace std;

class Solution {
public:
int waysToMakeFair(vector& nums) {
int evenSum = 0, oddSum = 0;
int prefixEven = 0, prefixOdd = 0, count = 0;

    // Calculate total sums for even and odd indices
    for (int i = 0; i < nums.size(); ++i) {
        if (i % 2 == 0) evenSum += nums[i];
        else oddSum += nums[i];
    }

    // Traverse the array and simulate removal
    for (int i = 0; i < nums.size(); ++i) {
        if (i % 2 == 0) {
            evenSum -= nums[i];  // Update remaining even sum
        } else {
            oddSum -= nums[i];   // Update remaining odd sum
        }

        // Calculate new sums after removal
        int newEvenSum = prefixEven + oddSum;
        int newOddSum = prefixOdd + evenSum;

        if (newEvenSum == newOddSum) {
            count++;
        }

        // Update prefix sums
        if (i % 2 == 0) {
            prefixEven += nums[i];
        } else {
            prefixOdd += nums[i];
        }
    }

    return count;
}

};