Displaying 1-4 of 4 result(s).
About Course
-
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.
Topics covered in this course
-
Section 1: Bit Manipulation Problems |
|
Lecture 0 |
You, This Course, and Us!
|
00:58 |
|
Lecture 2 |
|
10:07 |
|
Lecture 3 |
|
08:39 |
|
Lecture 4 |
|
13:13 |
|
Lecture 5 |
|
13:30 |
|
Lecture 6 |
|
18:54 |
|
Lecture 7 |
|
10:10 |
What you will get from this course?
-
- 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)
- Crack bit manipulation problems, whether in interviews or at work
Who should buy this course?
-
- Please don't enroll for this class if you have already enrolled for our course 'Break Away: Programming and Coding Interviews'
- New engineering graduate students who are interviewing for software engineering jobs
- Professionals from other fields with some programming knowledge looking to change to a software role
- Software professionals with several years of experience who want to brush up on core concepts
- 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
3898389939003901