Bitwise Left Shifts
The left-shift operator causes the bits in shift-expression to be shifted to the left by the number of positions specified by additive-expression. The bit positions that have been vacated by the shift operation are zero-filled.
Bit Manipulation
46 PostsIntroduction to Bit Shifting
A bit shift is a Bitwise operation where the order of a series of bits is moved, either to the left or right, to efficiently perform a mathematical operation.
Solution Review: Missing Number
We solved the problem using lookup (hashtable), using the mathematical formula. Let's solve this more efficiently using bit-level operations with XOR and then optimize the solution.
Solution Review: Single Number
Single Number coding question, can be easily solved with XOR bitwise technique with linear time complexity.
Challenge 1: Single Number
In this lesson, every element appears twice except one element. We solve this using naive, and then we move to solve it more optimally using XOR operator.
Hamming Distance
Hamming distance talks about two integers where the bit positions where the corresponding bits are different.
Detect If Two Integers Have Opposite Signs
In this question, input two numbers and detect if they have opposite signs. We solve using bitwise XOR operator
Find Odd Occurring Element
In this coding question, we find the odd-appearing element using bitwise xor. This algorithm is simple yet powerful.
Swap Two Numbers
In this coding question, we input two numbers and swap them without using the swapping logic.
Bitwise XOR, Computations, and Examples
A Bitwise XOR is a binary operation that takes two-bit patterns of equal length and performs the logical exclusive OR operation on each corresponding bits pair. Each position’s result is 0 if both bits are 0 or if both bits are 1. Otherwise, the result is 1.