Subset array sum by generating all the subsets Last Updated : 04 Feb, 2022 Comments Improve Suggest changes Like Article Like Report Given an array of size N and a sum, the task is to check whether some array elements can be added to sum to N . Note: At least one element should be included to form the sum.(i.e. sum cant be zero) Examples: Input: array = -1, 2, 4, 121, N = 5 Output: YES The array elements 2, 4, -1 can be added to sum to N Input: array = 1, 3, 7, 121, N = 5 Output:NO Approach: The idea is to generate all subsets using Generate all subsequences of array and correspondingly check if any subsequence has the sum equal to the given sum.Below is the implementation of the above approach: CPP // C++ implementation of the above approach #include <bits/stdc++.h> using namespace std; // Find way to sum to N using array elements atmost once void find(int arr[], int length, int s) { // loop for all 2^n combinations for (int i = 1; i < (pow(2, length)); i++) { // sum of a combination int sum = 0; for (int j = 0; j < length; j++) // if the bit is 1 then add the element if (((i >> j) & 1)) sum += arr[j]; // if the sum is equal to given sum print yes if (sum == s) { cout << "YES" << endl; return; } } // else print no cout << "NO" << endl; } // driver code int main() { int sum = 5; int array[] = { -1, 2, 4, 121 }; int length = sizeof(array) / sizeof(int); // find whether it is possible to sum to n find(array, length, sum); return 0; } Java // Java implementation of the above approach class GFG { // Find way to sum to N using array elements atmost once static void find(int [] arr, int length, int s) { // loop for all 2^n combinations for (int i = 1; i <= (Math.pow(2, length)); i++) { // sum of a combination int sum = 0; for (int j = 0; j < length; j++) // if the bit is 1 then add the element if (((i >> j) & 1) % 2 == 1) sum += arr[j]; // if the sum is equal to given sum print yes if (sum == s) { System.out.println("YES"); return; } } // else print no System.out.println("NO"); } // driver code public static void main(String[] args) { int sum = 5; int []array = { -1, 2, 4, 121 }; int length = array.length; // find whether it is possible to sum to n find(array, length, sum); } } // This code is contributed by ihritik Python3 # Python3 implementation from itertools import combinations def find(lst, n): print('YES' if [1 for r in range(1, len(lst) + 1) for subset in combinations(lst, r) if sum(subset) == n] else 'NO') find([-1, 2, 4, 121], 5) #This code is contributed by signi dimitri C# // C# implementation of the above approach using System; public class GFG { // Find way to sum to N using array elements atmost once static void find(int [] arr, int length, int s) { // loop for all 2^n combinations for (int i = 1; i <= (Math.Pow(2, length)); i++) { // sum of a combination int sum = 0; for (int j = 0; j < length; j++) // if the bit is 1 then add the element if (((i >> j) & 1) % 2 == 1) sum += arr[j]; // if the sum is equal to given sum print yes if (sum == s) { Console.Write("YES"); return; } } // else print no Console.Write("NO"); } // driver code public static void Main() { int sum = 5; int []array = { -1, 2, 4, 121 }; int length = array.Length; // find whether it is possible to sum to n find(array, length, sum); } } // This code is contributed by PrinciRaj19992 PHP <?php // PHP implementation of the above approach // Find way to sum to N using array elements atmost once function find($arr, $length, $s) { // loop for all 2^n combinations for ( $i = 1; $i < (pow(2, $length)); $i++) { // sum of a combination $sum = 0; for ($j = 0; $j < $length; $j++) // if the bit is 1 then add the element if ((($i >> $j) & 1)) $sum += $arr[$j]; // if the sum is equal to given sum print yes if ($sum == $s) { echo "YES","\n"; return; } } // else print no echo "NO","\n"; } // Driver code $sum = 5; $array = array(-1, 2, 4, 121 ); $length = sizeof($array) / sizeof($array[0]); // find whether it is possible to sum to n find($array, $length, $sum); // This code is contributed by ajit. ?> JavaScript <script> // Javascript implementation of the above approach // Find way to sum to N using array // elements atmost once function find(arr, length, s) { // loop for all 2^n combinations for (var i = 1; i < (Math.pow(2, length)); i++) { // sum of a combination var sum = 0; for (var j = 0; j < length; j++) // if the bit is 1 then add the element if (((i >> j) & 1)) sum += arr[j]; // if the sum is equal to given sum print yes if (sum == s) { document.write( "YES" + "<br>"); return; } } // else print no document.write( "NO" + "<br>"); } var sum = 5; var array = [ -1, 2, 4, 121 ]; var length = array.length; // find whether it is possible to sum to n find(array, length, sum); // This code is contributed by SoumikMondal </script> Output: YES Note: This program would not run for the large size of the array. Comment More infoAdvertise with us Next Article Subset array sum by generating all the subsets andrew1234 Follow Improve Article Tags : Bit Magic Competitive Programming DSA subset subsequence +1 More Practice Tags : Bit Magicsubset Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example 12 min read Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an 8 min read Like