LeetCode 190. Reverse Bits
Description https://leetcode.com/problems/reverse-bits/ Reverse bits of a given 32 bits unsigned integer. Example 1: Input: 00000010100101000001111010011100 Output: 00111001011110000010100101000000 Explanation: The input…
Tag: Yahoo Interview Question
LeetCode 191. Number of 1 Bits
Description https://leetcode.com/problems/number-of-1-bits/ Write a function that takes an unsigned integer and return the number of ‘1’ bits it has (also known as…
LeetCode 461. Hamming Distance
Description https://leetcode.com/problems/hamming-distance/ The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given two…
LeetCode 326. Power of Three
Description https://leetcode.com/problems/power-of-three/ Given an integer, write a function to determine if it is a power of three. Example 1: Input:…
LeetCode 204. Count Primes
Description https://leetcode.com/problems/count-primes/ Given an integer n, return the number of prime numbers that are strictly less than n. Example 1: Input: n =…
LeetCode 108. Convert Sorted Array to Binary Search Tree
Description https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For…
LeetCode 268. Missing Number
Description https://leetcode.com/problems/missing-number/ Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from…
LeetCode 118. Pascal’s Triangle
Description https://leetcode.com/problems/pascals-triangle/ Given a non-negative integer numRows, generate the first numRows of Pascal’s triangle. In Pascal’s triangle, each number is the sum of…
LeetCode 844. Backspace String Compare
Description https://leetcode.com/problems/backspace-string-compare/ Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character. Example…
LeetCode 876. Middle of the Linked List
Description https://leetcode.com/problems/middle-of-the-linked-list/ Given a non-empty, singly linked list with head node head, return a middle node of linked list. If there are two middle…