JAVA || Easy Solution Using HashSet
\tPLEASE UPVOTE IF YOU LIKE.\n\nclass Solution {\n    public boolean reorderedPowerOf2(int n) {\n        Set<Long> two = new HashSet<>();\n        for (int i = 
\tPLEASE UPVOTE IF YOU LIKE.\n```\nclass Solution {\n    public boolean reorderedPowerOf2(int n) {\n        Set<Long> two = new HashSet<>();\n        for (int i = 1; i <= (int)1e9; i <<= 1){\n            two.add(transform(i));\n        }\n\n        return two.contains(transform(n));\n    }\n\n    private long transform(int n){\n        long sum = 0;\n        while(n > 0){\n            int d = n % 10;\n            sum += 1L << (d*3);\n            n /= 10;\n        }\n\n        return sum;\n    }\n}\n```
['Java']