Solution in C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> Helper(long n){\n        vector<int>num(10);\n        while(n)\n        {\n            num[n%10]++;\n            n=n/10;\n        }\n        return num;\n    }\n    bool reorderedPowerOf2(int n)\n     {\n        vector<int>v=Helper(n);\n        for(int i=0;i<31;i++){\n            if(v==Helper(1<<i)){\n                return true;\n            }\n        }\n        return false;\n    }\n};\n```
['C++']