Python Coding Challenges

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.

Missing Number XOR

Given a list of n distinct numbers from 0 to n with one missing, use XOR to find and return the missing number.

xor bitwise arrays

bitwise gray-code encoding

Gray Code Encode

Implement a function that converts a non-negative integer to its Gray code representation using bitwise XOR and shift.

bitwise bit-manipulation integer

Find Rightmost Set Bit

Implement a function that returns the 1-indexed position of the rightmost set bit of a positive integer, or 0 if none.

+8 pts 12m

bit-manipulation bitwise algorithms

Isolate Rightmost Set Bit

Given an integer, return a number with only its rightmost set bit set.

+10 pts 10m

Add without plus

Implement a function that adds two integers using only bitwise operations, no arithmetic plus or minus.

bitwise addition xor

Clear kth Bit

Implement a function that clears the k-th bit of a non-negative integer (turns it to 0) using bitwise operations.

bit mask integer

+10 pts 10m

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 bitwise integer

Swap Odd and Even Bits

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

bitwise bit manipulation integers

Clear Rightmost Set Bit

Write a function clear_rightmost_set_bit that accepts a non-negative integer and returns the integer with its rightmost set bit cleared.

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

Parse bit field flags

Write a function that unpacks a bit field integer into a dict of named boolean flags.

bitmask bitwise flags

+10 pts 12m

Subset XOR sum

Given a list of integers, compute the bitwise XOR of each non-empty subset and return the sum of those XOR totals.

xor bitwise subsets

bit-manipulation bitwise integer

Check kth bit

Implement a function that checks whether the k-th bit of a non-negative integer is set (1) or not (0).

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

matrix list-comprehension bitwise

Matrix & 2D Arrays easy

Flipping an Image

Implement a function that flips an image represented as a binary matrix by reversing each row and inverting each pixel.