Clean and Easy to Understand digits Anagram
\nclass Solution {\n    public boolean reorderedPowerOf2(int N) {\n        for(int i = 0, num = 1; i < 32; i++, num <<= 1)\n            if(Arrays.equals(digitFr
```\nclass Solution {\n    public boolean reorderedPowerOf2(int N) {\n        for(int i = 0, num = 1; i < 32; i++, num <<= 1)\n            if(Arrays.equals(digitFreq(N), digitFreq(num)))\n                return true;\n        \n        return false;\n    }\n    \n    private int[] digitFreq(int N) {\n        int[] f = new int[10];\n        while(N > 0) {\n            f[N % 10]++;\n            N /= 10;\n        }\n        \n        return f;\n    }\n}\n```
[]