In this video I will discuss the idea behind bitmasking and I will also discuss a simple implementation based task.

Brief overview of what's discussed:
1. Designing efficient ways to store a subset of the first N natural numbers in memory.
2. set, vector, boolean arrays to store subsets.
3. Using integers to represent subsets.
4. Discussing how to add and remove elements from a subset represented as an integer.
5. Coding task.

Enjoy watching!!
Super useful books for algo ds and programming fundamentals!

1. Introduction to Algorithms by Cormen: https://amzn.to/35AmQqu
2. The Algorithm Design Manual: https://amzn.to/2K9RGPq
3. Fundamentals of Data Structures in C++: https://amzn.to/2LCwIsN
4. ObjectOriented Programming by E Balagurusamy: https://amzn.to/2Xxmdtr
5. Head First Java: https://amzn.to/39kb44K
6. Cracking the coding interview: https://amzn.to/3iDOHLK
7. Database System concepts: https://amzn.to/3pisuFQ
8. Operating Systems: https://amzn.to/39fcmis
9. Discrete Mathematics: https://amzn.to/2MlgCE6
10. Compiler Design: https://amzn.to/3pkYvx2