 New update is available. Click here to update.

# Bit Insertion

Contributed by
Amit Priyankar
Last Updated: 23 Feb, 2023
Easy 0/40
Avg time to solve 15 mins
Success Rate 85 % Share 1 upvotes

## Problem Statement

#### Inserting a number is resetting all the bits of 'X' from position 'A' to position 'B' and then writing 'Y' in 'X' starting from index 'A'.

##### For example :
``````X = 1536 and Y = 7, A = 1 and B = 5,
X is base 2 = 11000000000, Y in base 2 = 0111
First, we clear all the birts of X from index 1 to index 5 then wrote Y in X starting from A.
After inserting Y in X starting from position result will be 11000001110
``````
Detailed explanation ( Input/output format, Notes, Images ) ##### Constraints :
``````1 <= T <= 5000
1 <= X,Y <= 2^31
0 <= A <= B < 32

‘X’, ‘Y’, ‘A’, ‘B’ are two given integers and starting bit positions and ending bit position to insert respectively.
It is guaranteed that the position from ‘A’ to  ‘B’ is enough to insert Y.
Time Limit : 1 sec
``````
##### Sample Input 1 :
``````2
1 8 5 15
7 21 11 30
``````
##### Sample Output 1 :
``````257
43015
``````
##### Explanation of Sample Input 1 :
``````X and Y in base 2 are (00001), (01000), after clearing all the bits in X from 5’th to 15’th position and inserting Y we get (1000000001)
X and Y in base 2 are (111), (10101), after clearing all the bits in X from 11’th to 30’th position and inserting Y we get (0001010100000000111)
``````
##### Sample Input 2 :
``````2
12143435 564 1 10
21321454 129 11 30
``````
##### Sample Output 2 :
``````12143721
265966
``````  Auto Console