Bitwise Operations for Competitive Programming | Topic Stream 8

Bitwise operations - binary representation in general, the operations that can be done on binary numbers (both logical and bitwise), and some problemsolving techniques involving them. Feel free to use the timestamps to skip around to what you don't know, I started from a very basic level.

Here's the mashup (the practice problems) https://codeforces.com/contestInvitation/c8f43f431a9400e1a8b954d093ea2364a40dab86
and a pastebin with the sources and difficulties of each problem: https://pastebin.com/HLMw0a9q
The problems are roughly ordered by difficulty.

I currently can't find a problem on bitsets, will update the mashup if I do.

Stream will start Sunday, at the normal Codeforces round time: https://www.timeanddate.com/worldclock/fixedtime.html?msg=Topic+Stream+8&iso=20210919T1035&p1=263
I will take various questions and go over the practice problems.

Playlist of past streams: https://www.youtube.com/playlist?list=PLDjGkpToBsYCaRoQ-_S5MRxYMuKgHD62w
A similar, nice resource from Errichto: https://codeforces.com/blog/entry/73490

Timestamps:
Intro + what is binary? 00:00
Binary representation in computers 04:49
Bitwise and logical operations (and, xor, etc.) 07:00
Builtin functions (popcount, etc.) 21:15
Some tricks/identities 26:32
Using bitmasks, bitsets, bitmask DP 31:34
Main takeaways for problemsolving 39:46