Bitwise Operations tutorial #1 | XOR, Shift, Subsets

Errichto Algorithms • February 7, 2020

Errichto Algorithms

@errichto

About

Algorithms, competitive programming, coding interviews. I make educational videos and coding live streams, always sharing my thought process. My name is Kamil Dębowski (or Errichto) and I'm quite good at competitive programming. I'm a finalist of multiple big programming competitions like ICPC, Facebook Hacker Cup and Google Code Jam (even got 2nd place in 2018). I also organize competitions, which means inventing and preparing problems.

Latest Posts

PT4M

Day 3 | Advent of Code 2024

Errichto Algorithms1 year ago

9787

PT4M

Day 6 | Advent of Code 2024

Errichto Algorithms1 year ago

18024

PT4M

Kickstart 2021 Round C (1st place)

Errichto Algorithms4 years ago

219870

PT4M

Chinese Remainder Theorem, 2-minute Method

Errichto Algorithms4 years ago

105023

Video Description

Part 1 of tutorial on bitwise operations and bit manipulation in Competitive Programming: bitwise AND, OR, XOR, left and right shift, iterating over all subsets of a set. The content is the same as in my Codeforces article https://codeforces.com/blog/entry/73490. You can find more advanced tricks in TopCoder bits tutorial https://www.topcoder.com/community/competitive-programming/tutorials/a-bit-of-fun-fun-with-bits/. Subscribe for more educational videos on algorithms, coding interviews and competitive programming. - Github repository: https://github.com/Errichto/youtube - Live streams on 2nd YT channel and on Twitch: https://www.youtube.com/errichto2 & https://www.twitch.tv/errichto - FB and Twitter: https://www.facebook.com/errichto & https://twitter.com/errichto - Frequently Asked Questions: https://github.com/Errichto/youtube/wiki/FAQ