hello.......................... Qs:- Given an Array of contain elements range from 1 to 9 find all possible subsets and print all subsets whose sum is 10,
Assume all elements in the array are distinct. Exa:- input:---{1,2,6,3,4}; Output:- {4,6}, {1,6,3}, {1,2,3,4} input :-{9,8,7,6}; output:- No Thanks And Regards Umesh Kumar -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.