Practice
Resources
Contests
Online IDE
New
Free Mock
Scaler
Practice
Improve your coding skills with our resources
Contests
Compete in popular contests with top coders
Scaler
Explore Offerings by SCALER

## Welcome to Interviewbit, help us create the best experience for you!

Currently, You are a:

College/University *
Enter the name of your college
Branch *
Year of completion *

College/University *
Enter the name of your college
Branch *
Year of completion *

Current Company *
Enter company name
Experience *

## You're all set!

Full name *
Email *

By creating an account, I acknowledge that I have read and agree to InterviewBitâ€™s Terms and Privacy Policy .

Email *

Go to Problems

Be a Code Ninja!

# Bitwise operators ( contd.. )

##### Right Shift Operators :
A >> x
###### What does AÂ Â» x mean :

A >> x implies shifting the bits of A to the right by x positions. The last x bits are lost this way.

Example : Lets say

A = 29 ( 11101 ) and x = 2,
so A >> 2 means
0 0 1 1 1 0 1 >> 2
====  -> is lost
========== -----> this sequence of digit shifts to the right by 2 positions
----------------
0 0 0 0 1 1 1 = 7

A >> x is equal to division by pow(2, x). Think why.

##### Left shift operators :
A << x
###### What does A Â«Â x mean :

A << x implies shifting the bits of A to the left by x positions. The first x bits are lost this way. The last x bits have 0. Example : lets say

A = 29 ( 11101 ) and x = 2,
so A << 2 means
0 0 1 1 1 0 1 << 2
=============  ------> this sequence of digit shifts to the left by 2 positions
----------------
1 1 1 0 1 0 0  = 116

A << x is equal to multiplication by pow(2, x). Think why. 1 << x is equal to pow(2, x).

## Serious about Learning Programming ?

Learn this and a lot more with Scaler Academy's industry vetted curriculum which covers Data Structures & Algorithms in depth.

## Bit Manipulation Problems

Bit play
Problem Score Companies Time Status
Number of 1 Bits 200 8:47
Trailing Zeroes 200 14:44
Reverse Bits 225 23:50
Divide Integers 250 68:00
Different Bits Sum Pairwise 300 51:27
Bit tricks
Problem Score Companies Time Status
Min XOR value 200 37:42
Count Total Set Bits 200 63:18
Palindromic Binary Representation 200 59:59
XOR-ing the Subarrays! 200 33:00
Bit array
Problem Score Companies Time Status
Single Number 275 11:53
Single Number II 275 39:22

Problem Score Companies Time Status
Bit Flipping 200 19:28
Swap Bits 150 23:05
Free Mock Assessment
Help us know you better for the best experience
Current Employer *
Enter company name