4 docs tagged with "Bit Manipulation"

Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

Reverse bits of a given 32 bits unsigned integer.

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.