can we form subset by this bitmasking if string contains character of more then 70 because 2^60 is roughly 10^18
and after that number will overflow
how can we generate subset of that string which has bigger length…
Subset formation
@shampblocks
hello shubham,
we cannot use bitmask for larger size of string (overflow).
but we can use recursion
take current+move ahead or ignore current + move ahead
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.