Bit manipulation problems

See all bitmanipulation problems: #bitmanipulation.

- Review: Bit manipulation problems
- LintCode: Reverse 3-digit Integer
- LintCode: Hex Conversion
- LintCode: Binary Stream
- LintCode: A + B Problem
- Leetcode: UTF-8 Validation
- Leetcode: Total Hamming Distance
- Leetcode: Three Equal Parts
- Leetcode: Sum of Two Integers
- Leetcode: Sum of Digits in the Minimum Number
- Leetcode: Reverse Bits
- Leetcode: Pyramid Transition Matrix
- Leetcode: Prime Number of Set Bits in Binary Representation
- Leetcode: Number of 1 Bits
- Leetcode: Number Complement
- Leetcode: Multiply Strings
- Leetcode: Maximum XOR of Two Numbers in an Array
- Leetcode: Maximum Product of Word Lengths
- Leetcode: IP to CIDR
- Leetcode: Hamming Distance
- Leetcode: Find the Difference
- Leetcode: Counting Bits
- Leetcode: Convert to Base -2
- Leetcode: Convert a Number to Hexadecimal
- Leetcode: Complement of Base 10 Integer
- Leetcode: Chalkboard XOR Game
- Leetcode: Bitwise ORs of Subarrays
- Leetcode: Bitwise AND of Numbers Range
- Leetcode: Binary Number with Alternating Bits
- Leetcode: 1-bit and 2-bit Characters

See more blog_posts.