Hey Guys,
I have a problem where I have been given an array of some size n (Marks[n]) and I want to go through all possible combinations of all sizes from 1-n of the array elements.
For e.g., If the array has 5 elements the combinations would be
(Combinations of 5)
0 1 2 3 4 5