Can we do the string operation December challenege qs with this algo
- Find all subsets
- Store every subset as an array element.
- Delete the duplicates
- Check all elements with even number of 1s, if reversed, they match an element or not, if they do delete either of them
- Count the number of elements
Print the answer
If yes, please help me implementing it.