EasyNo. 2595
Number of Even and Odd Bits — LeetCode 2595 Python Solution
- Pattern
- Bit Manipulation
- Topics
- Bit Manipulation
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are given a positive integer n. Let even denote the number of even indices in the binary representation of n with value 1.
Python solution
class Solution:
def evenOddBit(self, n: int) -> List[int]:
ans = [0, 0]
i = 0
while n:
ans[i] += n & 1
i ^= 1
n >>= 1
return ansComplexity
- Time
- O(log n)
- Space · auxiliary
- O(1)
Pattern: Bit Manipulation
Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 2595. Number of Even and Odd Bits is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Bit Manipulation.
The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0029 | Divide Two Integers | Medium |
| 0067 | Add Binary | Easy |
| 0136 | Single Number | Easy |
| 0137 | Single Number II | Medium |
| 0190 | Reverse Bits | Easy |
| 0191 | Number of 1 Bits | Easy |
Frequently asked questions
- How hard is LeetCode 2595. Number of Even and Odd Bits?
LeetCode 2595. Number of Even and Odd Bits is rated Easy on LeetCode.
- What is the time complexity of LeetCode 2595. Number of Even and Odd Bits?
The Python solution on this page runs in O(log n).
- What is the space complexity of LeetCode 2595. Number of Even and Odd Bits?
The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 2595. Number of Even and Odd Bits cover?
LeetCode 2595. Number of Even and Odd Bits is tagged Bit Manipulation on LeetCode.