Approach: Converting into string, MAX TC: O(33*9*log(9)) i.e. O(1) constant time
\nclass Solution {\npublic:\n    \n    bool reorderedPowerOf2(int n) {\n        string s = to_string(n);\n        sort(s.begin(),s.end());\n        for(int i=0;
```\nclass Solution {\npublic:\n    \n    bool reorderedPowerOf2(int n) {\n        string s = to_string(n);\n        sort(s.begin(),s.end());\n        for(int i=0;i<33;i++){\n            string x = to_string((long long)pow(2,i));\n            sort(x.begin(),x.end());\n            if(s==x){\n                // cout<<s<<" "<<x<<endl;\n                return true;\n            }\n                        \n        }\n        \n        return false;\n        \n    }\n};\n```
['String', 'C']