Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 869 with 36 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 869 # by problem number
lcpy gen -s reordered_power_of_2 # by problem name
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.
Input: n = 1
Output: true
Input: n = 10
Output: false
class Solution:
# Time: O(d log d) where d is the number of digits in n
# Space: O(d)
def reordered_power_of_2(self, n: int) -> bool:
digits = sorted(str(n))
return any(sorted(str(1 << k)) == digits for k in range(31))
| Time | Space |
|---|---|
| O(d log d) where d is the number of digits in n | O(d) |