This is going to be a complete video lecture series on Bit Manipulation covering concepts in details with implementation details and practice problems to make concepts clear and gain confidence.
Lectures (will keep updating)
L00 : Course Overview
L01 : Binary Left and Right Shift
L02 : Checking for ith Set Bit
L03 : Counting Number of Set Bits
L04 : XOR and it’s properties
L05 : All Pair Sum XOR
L06 : Total Sum of All Pair XOR
Here i will be updating the list of practice problems from different Online judges
LeetCode
E001 : Number of 1 Bits | LeetCode 191
E002 : Counting Bits | LeetCode 338
E003 : Power of 2 | LeetCode 231
E004 : XOR Queries on subarray | LeetCode 1310
E005 : Minimum Flips to make A OR B Equal C | LeetCode 1318
E006 : Single Number II | LeetCode 1137
HackerRank
E001 : Lonely Integer | Bit Manipulation
E002 : Sum VS XOR | Bit Manipulation
HackerEarth
E001 : Subham and Binary String
E002 : Monk and the box of cookies
Codechef
E001 : AND Operation (Medium)
Your suggestion / support is needed for this channel(CodeNCode) to grow.
Thank you for your valuable time.
CodeNCode.