Generate subarray using bitmasking

#1

in the code of this problem why we are doing i less then 1 left shift n in print subset part

#2

@mohitshendre2609
As the total no of possible subsets is pow(2,N),where N is the length of string.And (1<<N) will give you 2 raise to power N.

for e.g string=“abc” ,N=3
so total possible cases =8
and (1<<N) i.e (1<<3) will give you 1000(i.e 8)