What is bitmasking and how is it useful in solving combinatorial problems?
Bitmasking is when you use masks to modify the values of variables in bitwise operations, primarily used for sorting data.
Thatâ€™s incorrect. Bitmasking involves representing sets using binary numbers, not sorting data.
Can you explain how bitmasking is used to solve subset problems like the subset sum problem?