Bit manipulation problems

Name | Summary |
---|---|

Confirm no two adjacent 1s in one integer | X & (X<<1) == 0 LeetCode: Maximum Students Taking Exam |

Two big integers: implements +, -, *, / |

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: Sort Integers by The Number of 1 Bits
- LeetCode: Reverse Bits
- LeetCode: Pyramid Transition Matrix
- LeetCode: Prime Number of Set Bits in Binary Representation
- LeetCode: Poor Pigs
- LeetCode: Number of Steps to Reduce a Number to Zero
- LeetCode: Number of Steps to Reduce a Number in Binary Representation to One
- 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: Couples Holding Hands
- 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 String With Substrings Representing 1 To N
- LeetCode: Binary Number with Alternating Bits
- LeetCode: 1-bit and 2-bit Characters

See more blog posts.