Byte-Sized-Chunks: Bit Manipulation Problems
4.5 (1 rating)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
340 students enrolled
Wishlisted Wishlist

Please confirm that you want to add Byte-Sized-Chunks: Bit Manipulation Problems to your Wishlist.

Add to Wishlist

Byte-Sized-Chunks: Bit Manipulation Problems

Learn how to set, test or reverse bits - interview favorites, made easy with a visual approach that you will love
4.5 (1 rating)
Instead of using a simple lifetime average, Udemy calculates a course's star rating by considering a number of different factors such as the number of ratings, the age of ratings, and the likelihood of fraudulent ratings.
340 students enrolled
Created by Loony Corn
Last updated 3/2016
Learn Fest Sale
Current price: $10 Original price: $20 Discount: 50% off
2 days left at this price!
30-Day Money-Back Guarantee
  • 1.5 hours on-demand video
  • 9 Supplemental Resources
  • Full lifetime access
  • Access on mobile and TV
  • Certificate of Completion
What Will I Learn?
  • Crack bit manipulation problems, whether in interviews or at work
View Curriculum
  • This course requires some basic understanding of a programming language, preferably C, C++, C# or Java. Bit manipulation algorithms and syntax are virtually identical all of these languages (of course the syntax is hardest in C:-))

Note: This course is a subset of our 20+ hour course 'Break Away: Programming Interviews' so please don't sign up for both:-)

Programming interviews are like standard plays in professional sport - and bit manipulation questions are very common in certain types of interviews!

This course has been drawn by a team that has conducted hundreds of technical interviews at Google and Flipkart

Bit manipulation problems are an interview favorite, and they also pop up in some real-word programming cases, particularly low-level or very computationally intensive tasks.

What's covered:

  • The bitwise AND, OR, NOT operators: Visually understand exactly how the bitwise AND, OR and NOT operators work
  • Bitwise Shifting - Overflow and Fill: The bitwise shift operators can be quite tricky - we cover these in some detail
  • Bit Manipulation - get and set a specific bit
  • Counting Set Bits with a nifty trick to do so in time complexity O(# of 1s)
  • Reverse Bits in a number

Using discussion forums

Please use the discussion forums on this course to engage with other students and to help each other out. Unfortunately, much as we would like to, it is not possible for us at Loonycorn to respond to individual questions from students:-(

We're super small and self-funded with only 2-3 people developing technical video content. Our mission is to make high-quality courses available at super low prices.

The only way to keep our prices this low is to *NOT offer additional technical support over email or in-person*. The truth is, direct support is hugely expensive and just does not scale.

We understand that this is not ideal and that a lot of students might benefit from this additional support. Hiring resources for additional support would make our offering much more expensive, thus defeating our original purpose.

It is a hard trade-off.

Thank you for your patience and understanding!

Who is the target audience?
  • Nope! Please don't enroll for this class if you have already enrolled for our 21-hour course 'Break Away: Programming and Coding Interviews'
  • YEP! New engineering graduate students who are interviewing for software engineering jobs
  • YEP! Professionals from other fields with some programming knowledge looking to change to a software role
  • YEP! Software professionals with several years of experience who want to brush up on core concepts
Students Who Viewed This Course Also Viewed
Curriculum For This Course
Expand All 7 Lectures Collapse All 7 Lectures 01:15:31
Bit Manipulation Problems
7 Lectures 01:15:31

We dig into the bitwise AND, OR and NOT operations - visually inspecting how they work.
Preview 10:07

We continue with bit manipulation - the right shift and left shift operators are very powerful, but they have 2 issues that you should be sure to understand: overflow, and fill.

Bit Manipulation - II

Before diving headlong into bit manipulation problems it's helpful to learn a few useful tricks which help you build a strong foundation to visualize working with bits.
Useful Bit Manipulation Techniques

Functions to get the nth bit of an integer and to set the nth bit of an integer. These are the building block functions and the concepts underlying these will be used for harder bit manipulation problems.

Get And Set The Nth Bit

Print all the bits used to represent an integer from the most significant bit to the least significant. Learn some subtle details about the shift right (>>) with negative numbers!

Count the number of 1s in an integer, and learn a neat trick which allows you to do it in complexity O(number of 1s).

Print And Count Bits

Reverse the bits in an integer. This pulls together a whole bunch of stuff from the last few problems. As in the case of hard problems, visualizing the process is key to solving this!
Reverse The Bits In An Integer
About the Instructor
Loony Corn
4.3 Average rating
3,790 Reviews
29,276 Students
69 Courses
A small team;ex-Google, Stanford and Flipkart

Loonycorn is us, Janani Ravi and Vitthal Srinivasan. Between us, we have studied at Stanford, been admitted to IIM Ahmedabad and have spent years  working in tech, in the Bay Area, New York, Singapore and Bangalore.

Janani: 7 years at Google (New York, Singapore); Studied at Stanford; also worked at Flipkart and Microsoft

Vitthal: Also Google (Singapore) and studied at Stanford; Flipkart, Credit Suisse and INSEAD too

We think we might have hit upon a neat way of teaching complicated tech courses in a funny, practical, engaging way, which is why we are so excited to be here on Udemy!

We hope you will try our offerings, and think you'll like them :-)