Practice Arena

Python Coding
Challenges

Write real Python in the browser. Instant feedback. From beginner to expert.

467 challenges 330 easy 120 medium 17 hard

All Easy Medium Hard

All Python Basics Strings & Text Lists & Arrays Dicts & Sets Functions & Closures OOP & Classes Data Structures & Algorithms Advanced Python Iterators & Generators Decorators & Context Managers Error Handling & Exceptions Regular Expressions Math & Number Theory Bit Manipulation Dynamic Programming Trees & Binary Trees Graphs & Graph Algorithms Recursion & Backtracking Greedy Algorithms Binary Search Two Pointers & Sliding Window Stacks & Queues Heaps & Priority Queues Linked Lists Matrix & 2D Arrays Datetime & Time Calculations Data Formats & Parsing SQL & SQLite Numpy & Vectorized Computing Cryptography & Hashing

Bit Manipulation easy

Check Power of Two Bits

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

bitwise power-of-two integer

Bit Manipulation easy

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

Bit Manipulation easy

Gray Code Encode

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

bitwise gray-code encoding

Bit Manipulation easy

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.

bitwise bit-manipulation integer

Bit Manipulation easy

Isolate Rightmost Set Bit

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

bit-manipulation bitwise algorithms

Bit Manipulation easy

Add without plus

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

bitwise addition xor

Bit Manipulation easy

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

Bit Manipulation easy

Sparse Number Check

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

bitwise binary conditionals

Showing 8 challenges · easy · Bit Manipulation

Bit Manipulation — Python coding challenges

What you will find here

This page lists bit manipulation challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.

Challenges vs tutorials and quizzes

Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.