Count ways to split array into two subsets having difference between their sum equal to K

Given an array A[] of size N and an integer diff, the task is to count the number of ways to split the array into… Read More

The post Count ways to split array into two subsets having difference between their sum equal to K appeared first on GeeksforGeeks.