not getting how to take approach to this question ,kindly help me
How to approach
@Himanshu0123
This problem can be solved using both recursion as well as bitmasking techniques.Simply generate all subsets of the given array using either technique and compute its sum. If any of the sum is 0 , print “true” , else “false”. Note that one of the subset is going to be the NULL subset in which no element will be counted. Make sure you do not consider as the sum returned by it will always be zero.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.