Loading…

Category · Bit Manipulation

Bit Manipulation — DSA Interview Problems

Every bit manipulation problem we index, grouped by the curriculum module that teaches its pattern. Each problem ships with multiple approaches, complexity analysis, and a line-by-line walkthrough in Java and Python.

Problems

Walkthroughs ready

12E · 7M · 1H

Difficulty mix

Java · Python

Languages

Grouped by curriculum module

Bit Manipulation problems by module

Bit Manipulation20 problems

Bitwise AND of Numbers Range

Sum Over Subsets (SOS DP)

Googlecodeforcesjane-street

hardExplained

Sum of All Subset XOR Totals

AmazonGoogleMicrosoft

mediumExplained

Counter Game

AmazonGooglebloomberg

AmazonGoogleMicrosoft

Bit Manipulation guide

How to master Bit Manipulation

Overview

Bit Manipulation is operating directly on the binary representation of numbers, and it shows up regularly in technical interviews. Bit questions test XOR tricks, masking, and counting/toggling bits efficiently.

Our library indexes 20 Bit Manipulation problems (12 easy, 7 medium, 1 hard), each solved brute-force → optimal in Java and Python with a line-by-line walkthrough and interview talking points. They're grouped below by the curriculum module that teaches the underlying pattern, so related problems reinforce one another.

If you remember one thing about Bit Manipulation, make it this: XOR cancels duplicates and n & (n-1) clears the lowest set bit — two tricks behind many bit problems. Once that clicks, the signature patterns — XOR tricks, bit masks, bit counting — start to feel like a checklist you run on every new problem.

Study playbook

1
Learn the pattern, not the problem
Focus on the recurring techniques behind Bit Manipulation: XOR tricks, bit masks, bit counting. Solving by pattern means you can handle a question you've never seen before.
2
Start brute force, then optimise
State the obvious solution and its complexity first, then explain the one change — usually hashing, sorting, or a pointer trick — that removes the bottleneck.
3
Write a reusable template
Distil Bit Manipulation into a skeleton you can write from memory. In the interview you adapt the template instead of inventing from scratch.
4
Finish with complexity
Always close by stating time and space complexity and why. It's an easy signal that separates prepared candidates.

Common pitfalls

Operator-precedence bugs with & | ^ and forgetting signed-shift behaviour on negative numbers.
Jumping straight to code on a Bit Manipulation problem without first stating the approach out loud.
Forgetting the small inputs — empty, single element, duplicates — that interviewers use to break naïve solutions.
Optimising one of time or space while silently making the other worse.

Frequently asked

Are Bit Manipulation questions common in coding interviews?

Yes. Bit Manipulation appears regularly at top tech companies, which is why it has its own module in our curriculum. Bit questions test XOR tricks, masking, and counting/toggling bits efficiently.

How should I study Bit Manipulation?

Work the problems below grouped by module, starting from easy and moving up. Read the module's theory page first, then solve its problems in order so the shared pattern (XOR tricks, bit masks, bit counting) becomes second nature.

What's the key idea behind Bit Manipulation?

XOR cancels duplicates and n & (n-1) clears the lowest set bit — two tricks behind many bit problems.

Do you provide solutions in Java and Python?

Every authored Bit Manipulation problem ships with both Java and Python solutions (toggleable), a line-by-line walkthrough of each approach, and a "what to say in the interview" summary.

Keep exploring

Browse DSA another way

Curriculum

18 modules · theory + practice

Explore

Curated sheets

Blind 75, NeetCode 150, Grind 75

Sliding window, DFS, DP, greedy…