Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. Return the quotient after dividing dividend by divisor.
Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.
Reverse bits of a given 32 bits unsigned integer.
Given an array nums of size n, return the majority element. The majority element is the element that appears more than [n / 2] times. You may assume that the majority element always exists in the array.