Reordered Power of 2
You are given an integer n. We reorder the digits in any order, including the original order, such that the leading digit is not zero.
Return true if and only if we can do this so that the resulting number is a power of two.
Example 1
Input
n = 1Output
trueThe number 1 is already a power of two.
Example 2
Input
n = 10Output
falseNo valid reordering of the digits of 10 forms a power of two without a leading zero.
Constraints
- 1 <= n <= 10^9
Asked at 5 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.