Code With Fun!
Finding position of rightmost different bit of given two numbers || Approach-1 || Efficient Approach
13:43
Code With Fun!
Finding position of rightmost different bit of given two numbers || Approach-1 || Brute Force
21:18
Code With Fun!
Check wheather a number can be expressed in form of 2^X(Approach - 1)[Brute Force]
38:16
Code With Fun!
Check wheather a number can be expressed in form of 2^X(Approach- 2)[Efficient]
18:18
Code With Fun!
Check wheather a number can be expressed in form of 2^X(Approach - 1)[Brute Force]
14:57
Code With Fun!
Check kth bit is set or not(Approach - 2)[Efficient]
19:09
Code With Fun!
Check kth bit is set or not(Approach-1)[Brute Force]
19:26
Code With Fun!
Find position of rightmost set bit in binary representation of a number (Approach - 2)[Efficient]
22:51
Code With Fun!
Find position of rightmost set bit in binary representation of a number (Approach - 1)[Brute Force]
14:49
Code With Fun!
[TRICK] Decimal and Binary Conversion
16:53
Code With Fun!
Decimal To Binary Part - 2(Using Bitwise Operator)
21:16
Code With Fun!
Decimal To Binary Part - 1(Using Arithmetic Operator)
9:00
Code With Fun!
Bit Manipulation Introduction
2:33