Level 1 : Session 6 | Bitmasks & bit manipulation

Slides Link: https://www.canva.com/design/DAGVnRmoi5E/sFxgE62o_c-in-vynoLu8A/edit?utm_content=DAGVnRmoi5E&utm_campaign=designshare&utm_medium=link2&utm_source=sharebutton

Sheet Link: https://vjudge.net/group/level_one_public_group

Timeline:
00:00:00 Intro
00:01:00 Number systems & base representations
00:19:13 Problem: Find the minimum number of operations
00:33:45 Bitwise operations
01:00:10 Properties of bitwise operators
01:10:00 Applications on bitwise operations
01:32:22 Number modulo power of 2
01:38:00 Problem: XOR Mixup
01:45:52 Problem: Maximal AND
02:04:20 XOR of all numbers from 0 to n
02:15:28 Calculate bitwise XOR, OR, AND in a range [ l, r ]
02:47:58 Monotonicity of AND, OR on a prefix
03:00:48 Problem: Iva & Pav
03:11:20 Introduction to complete search, problem revisited: Preparing Olympiad
03:17:40 Bitmasks and how to apply a mask to the array
03:23:27 Solving Preparing Olympiad problem using complete search
03:32:30 Bitset

Видео Level 1 : Session 6 | Bitmasks & bit manipulation канала ICPC Mansoura Community