python3 | easy understanding | sort
\nclass Solution:\n    def reorderedPowerOf2(self, n: int) -> bool:\n        i, arr = 0, []\n        v = 2**i\n        while v <= 10**9: arr.append(sorted(str(v
```\nclass Solution:\n    def reorderedPowerOf2(self, n: int) -> bool:\n        i, arr = 0, []\n        v = 2**i\n        while v <= 10**9: arr.append(sorted(str(v))); i+=1; v = 2**i\n        return sorted(str(n)) in arr\n```
['Math', 'Sorting', 'Python3']