Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/xor-operation-in-an-array/ Given an integer n and an integer start. Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length. Return the bitwise XOR of…
Description https://leetcode.com/problems/bitwise-and-of-numbers-range/ Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of…
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…
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…
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…