Lesson overview · Free interview practice

Bit Manipulation

Perform operations directly on binary representations of numbers.

Topics in the full lesson
  • Concept and Use Cases
  • Key Bitwise Operators
  • Practical Examples
  • Tips and Tricks
  • Common Gotchas
  • Time and Space Complexity
  • Advanced Bit Manipulation Techniques
  • Real-World Applications

Practice Problems

Work through a question before revealing its explanation. These questions and answers are free; Premium adds the full lesson walkthrough, examples and implementation detail.

Completion marks record your own progress, not an automatically checked result. The task type does not determine whether it is optional.

CodingMedium

Maximum XOR of Two Numbers in an Array

Question

Given an integer array nums, return the maximum value of nums[i] XOR nums[j] over all pairs of indices i and j.

Take a moment to think about this before revealing the answer

Explain your reasoning or try an implementation before comparing answers.

Practice on LeetCode
CodingMedium

Sum of Two Integers

Question

Given two integers a and b, return their sum without using the + and - operators.

Take a moment to think about this before revealing the answer

Explain your reasoning or try an implementation before comparing answers.

Practice on LeetCode

Explore the full Bit Manipulation material

Premium includes the complete lessons and implementation references. Free practice questions remain available without a subscription.

All course tracks & premium content
From basics to advanced masterclasses
Built for JS/TS developers like you
Real-world tips & common pitfalls
Upgrade to Premium