Given an integer n, determine whether the digits of n can be rearranged to form a power of two. Each digit must be used exactly once in the rearrangement, and the resulting number must not have leading zeros. Return true if such a rearrangement exists, otherwise return false.

Note: A rearrangement is not allowed to produce a number with leading zeros.

Constraints:

• $1 \leq$ n $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.