This post introduces basic operations and tricks about bit manipulation.
Given an integer, write a function to determine if it is a power of two.
Write a function that takes an unsigned integer and returns the number of ’1' bits it has.
Reverse bits of a given 32 bits unsigned integer.
Given an array of integers, every element appears twice except for one. Find that single one.
Given an array of integers, every element appears three times except for one. Find that single one.
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
Write a function to find all the 10-letter-long sequences (substrings) that occur more than once in a DNA molecule.
Given a range [m, n], return the bitwise AND of all numbers in this range, inclusive.