c++ simple solution
Convert our given number to string (to_string())\n2.  Sort it (sort())\n3.  Compare it will all sorted string forms of 2 power numbers upto 30 ( 2^31 > 10^9)\n4
1.  Convert our given number to string (`to_string()`)\n2.  Sort it (`sort()`)\n3.  Compare it will all sorted string forms of 2 power numbers upto 30 ( 2^31 > 10^9)\n4.  If equals to anyone return `true`\n5.  else if no-match found return `false`\n\n**PLEASE UPVOTE IF YOU LIKED THIS \uD83D\uDE09\uD83D\uDE4C**\n\n\n\n\n\n```\nbool reorderedPowerOf2(int n) {\n\tstring s = sortedString(n);\n\tfor(int i = 0; i < 30; ++i){\n\t\tif(s == sortedString(1<<i)) return true;\n\t}\n\treturn false;\n}\nstring sortedString(int n){\n\tstring s = to_string(n);\n\tsort(s.begin(),s.end());\n\treturn s;\n}\n```
['C', 'Sorting']