Create SubsetsByBTM.cpp

[Omji-Kesharwani]

Description:

This problem involves finding all unique subsets of a given set of integers, which may contain duplicates. The task is to generate these subsets in lexicographical order, ensuring that no subset is repeated. By sorting the input and using a backtracking approach, the algorithm efficiently handles duplicates and outputs all possible combinations, including the empty set.

Type of change: Finding unique subsets by bitmasking

• [ ] Bug fix (non-breaking change which fixes an issue)
• [ ] New feature (non-breaking change which adds functionality)
• [ ] Breaking change (fix or feature that would cause existing functionality to not work as expected)
• [ ] Change in documentation

Checklist:

• [ ] My code follows the style guidelines of this project.
• [ ] I have performed a self-review of my own code.
• [ ] I have commented my code, particularly in hard-to-understand areas.
• [ ] I have made corresponding changes to the documentation.
• [ ] My changes generate no new warnings.
• [ ] I have added tests that prove my fix is effective or that my feature works.
• [ ] New and existing unit tests pass locally with my changes.
• [ ] Any dependent changes have been merged and published in downstream modules.
• [ ] Necessary documentation changes done
• [ ] I have added the file in the correct directory

Screenshots / Video: