Another 0ms C++ solution, No special data structure.
\n    int myPow(int a) {              //  returns 10^a;\n        if(!a) return 1;\n\n        int res=1;\n        while(a--)\n\t\t\t\tres *= 10;\n\n        retur
```\n    int myPow(int a) {              //  returns 10^a;\n        if(!a) return 1;\n\n        int res=1;\n        while(a--)\n\t\t\t\tres *= 10;\n\n        return res;\n    }\n\n    int counter(int N, int& c1 ) {\n        int res = 0;\n\n        for (; N; N /= 10) {res += myPow(N%10); c1++;}\n\n        return res;\n    }\n\n\n    bool reorderedPowerOf2(int N) {\n        if(N<10) {\n            if(N==1 || N==2 || N==4 || N==8) return true;\n            return false;\n        }\n        \n        int c, cc=0;\n        c = counter(N, cc);\n\n        for (int i = 2*cc, k; i < 3*cc+3; i++)\n            if (counter(1 << i, k) == c) return true;\n\n        return false;\n    } \n\t\t```
[]