Breaking News: Grepper is joining You.com. Read the official announcement!

DP Approach for Equal Sums

Harsh Gupta answered on August 31, 2023 Popularity 1/10 Helpfulness 1/10

answer DP Approach for Equal Sums

DP Approach for Equal Sums

Comment

class Solution {
public:
	int target;
	int dp[17][1 << 17];
    int finalBitMask;
	int solve(int count, int bitMask, int sum, int desiredSum , int &k, vector<int> &nums) {

        if(bitMask == finalBitMask) return count == k;
        
        if(dp[count][bitMask] != -1) return dp[count][bitMask];
        
        
        bool curAns = false;
		for (int i = 0; i < nums.size(); i++) {
			if (sum + nums[i] <= desiredSum && !(bitMask & (1 << i))) {
				if (sum + nums[i] == desiredSum) {
					curAns = solve(count + 1, bitMask ^ (1 << i), 0, desiredSum, k, nums);
					if(curAns) break;
				} else {
					curAns = solve(count, bitMask ^ (1 << i), sum + nums[i], desiredSum, k, nums);
                    if(curAns) break;
				}
			}
		}
		return dp[count][bitMask] = curAns;
	}
	bool canPartitionKSubsets(vector<int>& nums, int k) {
		int sum = accumulate(nums.begin(), nums.end(), 0);
		if (sum % k) return false;
		int N = nums.size();
		memset(dp, -1, sizeof(dp));

		finalBitMask = ((1 << N) - 1);

		target = sum / k;

		return solve(0, 0, 0, target, k, nums);


	}
};

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: chat.openai.com

Tags: whatever

Link to this answer
Share Copy Link

Contributed on Aug 31 2023

Harsh Gupta

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

DP Approach for Equal Sums

Contents

More Related Answers

DP Approach for Equal Sums

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.