Space optimization using bit manipulations

There are many situations where we use integer values as index in array to see presence or absence, we can use bit manipulations to optimize space in such problems.
Let us consider below problem as an example.
Given two numbers say a and b, mark the multiples of 2 and 5 between a and b using less than O(|b - a|) space and output each of the multiples. 

Note : We have to mark the multiples i.e save (key, value) pairs in memory such that each key either have value as 1 or 0 representing as multiple of 2 or 5 or not respectively. 

Examples :  

Input : 2 10
Output : 2 4 5 6 8 10

Input: 60 95
Output: 60 62 64 65 66 68 70 72 74 75 76 78 
 80 82 84 85 86 88 90 92 94 95

Approach 1 (Simple): 

Hash the indices in an array from a to b and mark each of the indices as 1 or 0. 
Space complexity : O(max(a, b))

👁 Image

Approach 2 (Better than simple): 

Save memory, by translating a to 0th index and b to (b-a)th index. 
Space complexity : O(|b-a|).

👁 Image

Simply hash |b - a| positions of an array as 0 and 1.

Implementation:

MULTIPLES of 2 and 5:
2 4 5 6 8 10 

Time Complexity: O(|b - a|)

Auxiliary space: O(|b - a|)

Approach 3 (Using Bit Manipulations):

Here is a space optimized which uses bit manipulation technique that can be applied to problems mapping binary values in arrays. 

Size of int variable in 64-bit compiler is 4 bytes. 1 byte is represented by 8 bit positions in memory. So, an integer in memory is represented by 32 bit positions(4 Bytes) these 32 bit positions can be used instead of just one index to hash binary values.

👁 Image

We can Implement the above Approach for 32-bit integers by following these steps

1.  Find the actual index in int[] that needs to be bit manipulated it will be bitwise index/ 32.
2.  Find the index of bit in those 32 bits that needs to be turned on it will be bitwise index % 32.  Let's Call it X
3.  Turn on the bit by doing | (bitwise OR) with (1 << X) (here we turn on the Xth bit by bit manipulation)
4.  To get the value of a bit at a bitwise index we calculate the same indices and do a bitwise & so that if Xth bit is on it will return an integer not equal to 0 which is true in C++.
5. Now instead of using arithmetic operators we can use bitwise operations for efficiency

Implementation:

MULTIPLES of 2 and 5:
2 4 5 6 8 10 

Time Complexity: O(|b - a|)
Auxiliary space: O(|b - a|)