Count of unique subsequences from given number which are power of 2
Given a string S of size N and containing digits in the range [0-9], the task is to print the count of all the unique subsequences of a string that are the power of 2. Examples: Input: S = "1216389"Output: 5Explanation:All the possible unique subsequences that are power of 2 are: {1, 2, 16, 128, 8}