Python Coding Challenges

bit-manipulation binary counting

Count Set Bits

Implement a function that returns the number of set bits (1s) in the binary representation of a non-negative integer.

bitwise power-of-two integer

Check Power of Two Bits

Implement is_power_of_two(n) that returns True if n is a power of two and False otherwise.

bit-manipulation integer rotation

Rotate Bits Left

Implement a function that rotates the bits of an integer to the left by a specified number of positions.

bit-manipulation bits integer

Set kth Bit

Implement a function that sets the kth bit (0-indexed) of a non-negative integer to 1 and returns the result.

bit-manipulation strings compression

Compress Bits Run

Write a function that compresses a binary string by representing consecutive identical bits as a count-bit pair.

bitwise binary conditionals

Sparse Number Check

Check if a non-negative integer is sparse, meaning its binary representation contains no adjacent 1 bits.

bit-manipulation integers counting

Brian Kernighan count

Implement a function that counts set bits using Brian Kernighan's efficient algorithm.

bit-manipulation binary integer

Reverse Bits

Implement a function that reverses the bits of a given 32-bit unsigned integer.

bit-manipulation bitwise integer

Swap Odd and Even Bits

Write a function that swaps odd and even bits of a non-negative integer.

bit-manipulation binary counting

Find Duplicate Bits

Given a positive integer, return the positions where the bit value appears more than once in its binary form.

+8 pts 12m

Odd Parity Bit

Given an integer, return the odd parity bit (0 or 1) so that total number of 1-bits in the 8-bit representation becomes odd.

bitwise parity integer

Even Parity Bit

Given an integer, return the even parity bit (0 or 1) that makes the total count of set bits even.

bitwise parity bits