| Problem 1: Single Number I |
In 2n+1 array find unique element |
LeetCode |
| Problem 2: Single Number II |
In 3n+1 array find two unique elements |
LeetCode |
| Problem 3: Single Number III |
In 2n+2 array find two unique elements |
LeetCode |
| Problem 4: Sum of All Subset XOR Totals |
The XOR total of an array is defined as the bitwise XOR of all its elements, or 0 if the array is empty |
LeetCode |
| Problem 5: Sum of Values at Indices With K Set Bits |
Return an integer that denotes the sum of elements in nums whose corresponding indices have exactly k set bits in their binary representation. |
LeetCode |
| Problem 6: Number of Even and Odd Bits |
Count the number of even and odd indices with value 1 in binary representation. |
LeetCode |
| Problem 8: Find K-or of the Array |
You are given an integer array nums, and an integer k. Let's introduce K-or operation by extending the standard bitwise OR. In K-or, a bit position in the result is set to 1 if at least k numbers in nums have a 1 in that position. |
LeetCode |
| Problem 9: Set Mismatch |
Find the number that occurs twice and the number that is missing and return them in the form of an array. |
LeetCode |
| Problem 10: Complement of Base 10 Integer |
The complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation. |
LeetCode |
| Problem 11: Binary Number with Alternating Bits |
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values. |
LeetCode |