Solution would use bitmasks to generate all sums which can be obtained by picking some subset of a given array and summing up the member elements.
Language: C++
I would like to work on this problem.
can i work on this problem
Sure @keerthanapolkampally Go ahead 馃憤
I would like to work on this in java.
Sure. Go for it 馃憤
I also submitted a PR on tribonacci series and Inversion count in java. Can you review it?
merged 馃憤